scientific article

From MaRDI portal
Publication:3484349

zbMath0704.68034MaRDI QIDQ3484349

Halina Przymusinska, Teodor C. Przymusinski

Publication date: 1990


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (22)

Well-founded semantics for Boolean grammarsSolving abduction by computing joint explanations. Logic programming formalization, applications to P2P data integration, and complexity resultsWell-founded and stationary models of logic programsLogic programming and reasoning with incomplete informationAutoepistemic logic of knowledge and beliefsTwo simple characterizations of well-founded semanticsDefault consequence relations as a logical framework for logic programsThe intricacies of three-valued extensional semantics for higher-order logic programsThree-valued nonmonotonic formalisms and semantics of logic programsContributions to the stable model semantics of logic programs with negationLocally stratified Boolean grammarsSkeptical reason maintenance and belief revisionAn infinite-game semantics for well-founded negation in logic programmingThe alternating fixpoint of logic programs with negationStratified negation in temporal logic programming and the cycle-sum testConstructive negation and constraint logic programming with setsAn encompassing framework for paraconsistent logic programsNegation in rule-based database languages: A surveyA Game-Theoretic Characterization of Boolean GrammarsSoundness of abductive proof procedure with respect to constraint for non-ground abduciblesTemporal stratification tests for linear and branching-time deductive databasesAdding closed world assumptions to well-founded semantics







This page was built for publication: