Publication:3484349
From MaRDI portal
zbMath0704.68034MaRDI QIDQ3484349
Halina Przymusinska, Teodor C. Przymusinski
Publication date: 1990
Related Items
Stratified negation in temporal logic programming and the cycle-sum test, Constructive negation and constraint logic programming with sets, Contributions to the stable model semantics of logic programs with negation, Skeptical reason maintenance and belief revision, The alternating fixpoint of logic programs with negation, Negation in rule-based database languages: A survey, Well-founded semantics for Boolean grammars, Locally stratified Boolean grammars, Three-valued nonmonotonic formalisms and semantics of logic programs, Soundness of abductive proof procedure with respect to constraint for non-ground abducibles, Adding closed world assumptions to well-founded semantics, Autoepistemic logic of knowledge and beliefs, An encompassing framework for paraconsistent logic programs, Well-founded and stationary models of logic programs, Logic programming and reasoning with incomplete information, Solving abduction by computing joint explanations. Logic programming formalization, applications to P2P data integration, and complexity results, An infinite-game semantics for well-founded negation in logic programming, Temporal stratification tests for linear and branching-time deductive databases, A Game-Theoretic Characterization of Boolean Grammars
