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

DOI10.1007/BF00881915zbMATH Open0819.68036MaRDI QIDQ1344892FDOQ1344892

Katsumi Inoue, Chiaki Sakama

Publication date: 22 February 1995

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

Recommendations

• scientific article; zbMATH DE number 5033761
• scientific article; zbMATH DE number 1453064
• Theory and algorithms for disjunctive deductive databases
• Minimal founded semantics for disjunctive logic programs and deductive databases
• scientific article; zbMATH DE number 25192

zbMATH Keywords

disjunctive logic programsdeductive databasespossible model semantics

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (26)

• Title not available (Why is that?)
• Relational theories with null values and non-herbrand stable models
• On logic programming interpretations of Dislog: Programming long-distance dependencies in logic
• Disjunction as alternative choices
• Combining event calculus and description logic reasoning via logic programming
• Abduction from logic programs: Semantics and complexity
• Duality for goal-driven query processing in disjunctive deductive databases
• A paraconsistent approach to actions in informationally complex environments
• Answer sets and qualitative decision making
• Characterizing and extending answer set semantics using possibility theory
• CP-logic: A language of causal probabilistic events and its relation to logic programming
• On the extension of logic programming with negation through uniform proofs
• Extending and implementing the stable model semantics
• The Fusemate logic programming system
• Possible models computation and revision -- a practical approach
• Interpreting disjunctive logic programs based on a strong sense of disjunction
• Qualitative Constraint Enforcement in Advanced Policy Specification
• Title not available (Why is that?)
• Brave induction: a logical framework for learning from incomplete information
• An abductive framework for negation in disjunctive logic programming
• Theory and algorithms for disjunctive deductive databases
• Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs
• Title not available (Why is that?)
• Indefinite abductive explanations
• A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation
• Minimal founded semantics for disjunctive logic programs and deductive databases

Uses Software

• SATCHMO

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1344892)