An alternative approach to the semantics of disjunctive logic programs and deductive databases

DOI10.1007/BF00881915zbMath0819.68036MaRDI QIDQ1344892

Katsumi Inoue, Chiaki Sakama

Publication date: 22 February 1995

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

zbMATH Keywords

disjunctive logic programsdeductive databasespossible model semantics

Mathematics Subject Classification ID

Database theory (68P15) Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (16)

Combining event calculus and description logic reasoning via logic programming ⋮ Abduction from logic programs: Semantics and complexity ⋮ On the extension of logic programming with negation through uniform proofs ⋮ Characterizing and extending answer set semantics using possibility theory ⋮ Qualitative Constraint Enforcement in Advanced Policy Specification ⋮ Brave induction: a logical framework for learning from incomplete information ⋮ Relational theories with null values and non-herbrand stable models ⋮ The Fusemate logic programming system ⋮ CP-logic: A language of causal probabilistic events and its relation to logic programming ⋮ Indefinite abductive explanations ⋮ Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs ⋮ An abductive framework for negation in disjunctive logic programming ⋮ A paraconsistent approach to actions in informationally complex environments ⋮ Answer sets and qualitative decision making ⋮ Possible models computation and revision -- a practical approach ⋮ Extending and implementing the stable model semantics

Uses Software

• SATCHMO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inferring negative information from disjunctive databases
• Circumscription - a form of non-monotonic reasoning
• Nonmonotonic reasoning, preferential models and cumulative logics
• The relationship between stable, supported, default and autoepistemic semantics for general logic programs
• Disjunctive \(LP+\) integrity constraints = stable model semantics.
• Generalized disjunctive well-founded semantics for logic programs.
• Formalizing a logic for logic programming
• Weak generalized closed world assumption
• Negation as failure for disjunctive logic programming
• Completed logic programs and their consistency
• The Semantics of Predicate Logic as a Programming Language
• Autoepistemic logic

This page was built for publication: An alternative approach to the semantics of disjunctive logic programs and deductive databases