An alternative approach to the semantics of disjunctive logic programs and deductive databases
From MaRDI portal
Publication:1344892
Recommendations
Cites work
- scientific article; zbMATH DE number 4199656 (Why is no real title available?)
- scientific article; zbMATH DE number 4094866 (Why is no real title available?)
- scientific article; zbMATH DE number 3755910 (Why is no real title available?)
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 25192 (Why is no real title available?)
- scientific article; zbMATH DE number 88998 (Why is no real title available?)
- scientific article; zbMATH DE number 1348475 (Why is no real title available?)
- Autoepistemic logic
- Circumscription - a form of non-monotonic reasoning
- Completed logic programs and their consistency
- Disjunctive \(LP+\) integrity constraints = stable model semantics.
- Formalizing a logic for logic programming
- Generalized disjunctive well-founded semantics for logic programs.
- Inferring negative information from disjunctive databases
- Negation as failure for disjunctive logic programming
- Nonmonotonic reasoning, preferential models and cumulative logics
- The Semantics of Predicate Logic as a Programming Language
- The relationship between stable, supported, default and autoepistemic semantics for general logic programs
- Weak generalized closed world assumption
Cited in
(26)- Indefinite abductive explanations
- Theory and algorithms for disjunctive deductive databases
- Disjunction as alternative choices
- scientific article; zbMATH DE number 1735824 (Why is no real title available?)
- scientific article; zbMATH DE number 4199656 (Why is no real title available?)
- Relational theories with null values and non-Herbrand stable models
- Combining event calculus and description logic reasoning via logic programming
- Duality for goal-driven query processing in disjunctive deductive databases
- Abduction from logic programs: Semantics and complexity
- On the extension of logic programming with negation through uniform proofs
- Extending and implementing the stable model semantics
- The Fusemate logic programming system
- CP-logic: A language of causal probabilistic events and its relation to logic programming
- Interpreting disjunctive logic programs based on a strong sense of disjunction
- Characterizing and extending answer set semantics using possibility theory
- Brave induction: a logical framework for learning from incomplete information
- Qualitative Constraint Enforcement in Advanced Policy Specification
- Iteratively-supported formulas and strongly supported models for Kleene answer set programs (extended abstract)
- scientific article; zbMATH DE number 5033761 (Why is no real title available?)
- Possible models computation and revision -- a practical approach
- An abductive framework for negation in disjunctive logic programming
- A paraconsistent approach to actions in informationally complex environments
- Answer sets and qualitative decision making
- Minimal founded semantics for disjunctive logic programs and deductive databases
- On logic programming interpretations of Dislog: Programming long-distance dependencies in logic
- A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation
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)
