scientific article

zbMath0704.68034MaRDI QIDQ3484349

Halina Przymusinska, Teodor C. Przymusinski

Publication date: 1990

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

zbMATH Keywords

logic programmingdeductive databaseslogic program semantics

Mathematics Subject Classification ID

Database theory (68P15) Artificial intelligence (68T99)

Related Items

Well-founded semantics for Boolean grammars, Solving abduction by computing joint explanations. Logic programming formalization, applications to P2P data integration, and complexity results, Well-founded and stationary models of logic programs, Logic programming and reasoning with incomplete information, Autoepistemic logic of knowledge and beliefs, Two simple characterizations of well-founded semantics, Default consequence relations as a logical framework for logic programs, The intricacies of three-valued extensional semantics for higher-order logic programs, Three-valued nonmonotonic formalisms and semantics of logic programs, Contributions to the stable model semantics of logic programs with negation, Locally stratified Boolean grammars, Skeptical reason maintenance and belief revision, An infinite-game semantics for well-founded negation in logic programming, The alternating fixpoint of logic programs with negation, Stratified negation in temporal logic programming and the cycle-sum test, Constructive negation and constraint logic programming with sets, An encompassing framework for paraconsistent logic programs, Negation in rule-based database languages: A survey, A Game-Theoretic Characterization of Boolean Grammars, Soundness of abductive proof procedure with respect to constraint for non-ground abducibles, Temporal stratification tests for linear and branching-time deductive databases, Adding closed world assumptions to well-founded semantics