On the computational cost of disjunctive logic programming: Propositional case
From MaRDI portal
Publication:1924780
DOI10.1007/BF01536399zbMath0858.68016WikidataQ59259761 ScholiaQ59259761MaRDI QIDQ1924780
Publication date: 25 March 1997
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
68N17: Logic programming
Related Items
Detecting Inconsistencies in Large Biological Networks with Answer Set Programming, Declarative Semantics for Active Integrity Constraints, Closed world assumption for disjunctive reasoning, Enhancing disjunctive logic programming systems by SAT checkers, Equivalence issues in abduction and induction, Equilibrium logic, Reasoning under minimal upper bounds in propositional logic, Computing only minimal answers in disjunctive deductive databases, Expressive power and complexity of partial models for disjunctive deductive databases, Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation, Abduction from logic programs: Semantics and complexity, Logic programming and knowledge representation---The A-Prolog perspective, Extending and implementing the stable model semantics, Propositional default logics made easier: computational complexity of model checking., Brave induction: a logical framework for learning from incomplete information, Bounded treewidth as a key to tractability of knowledge representation and reasoning, Combining answer set programming with description logics for the semantic web, Semantic forgetting in answer set programming, Outlier detection using default reasoning, Complexity results for answer set programming with bounded predicate arities and implications, On look-ahead heuristics in disjunctive logic programming, Characterising equilibrium logic and nested logic programs: Reductions and complexity,, $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols, Implementing Prioritized Circumscription by Computing Disjunctive Stable Models, Brave Induction, Inductive Negotiation in Answer Set Programming, Answer Set Programming: A Primer, Relativized hyperequivalence of logic programs for modular programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Negation by default and unstratifiable logic programs
- Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete
- Semantical considerations on nonmonotonic logic
- Negation as failure: careful closure procedure
- Inferring negative information from disjunctive databases
- On the relationship between circumscription and negation as failure
- A logic for default reasoning
- Circumscription - a form of non-monotonic reasoning
- General logical databases and programs: Default logic semantics and stratification
- Hard problems for simple default logics
- Three-valued nonmonotonic formalisms and semantics of logic programs
- How complicated is the set of stable models of a recursive logic program?
- The complexity of model checking for circumscriptive formulae
- The complexity of propositional closed world reasoning and circumscription
- Generalized disjunctive well-founded semantics for logic programs.
- A theory of nonmonotonic rule systems. II
- Deduction in non-Horn databases
- Weak generalized closed world assumption
- The expressiveness of locally stratified programs
- Propositional semantics for disjunctive logic programs
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
- Bounded Query Classes
- Horn clause queries and generalizations
- Complexity Results for Nonmonotonic Logics
- A survey of complexity results for non-monotonic logics
- Autoepistemic logic
- The well-founded semantics for general logic programs
