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)
Related Items
Backdoors to Normality for Disjunctive Logic Programs, Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs, Active integrity constraints and revision programming, On elementary loops of logic programs, Witnesses for Answer Sets of Logic Programs, Evaluating epistemic negation in answer set programming, Equivalence issues in abduction and induction, Progress in clasp Series 3, Logic Programming with Graded Modality, Disjunctive Programs with Set Constraints, Well-Supported Semantics for Logic Programs with Generalized Rules, Learning Boolean controls in regulated metabolic networks: a case-study, Backdoors to Satisfaction, Characterising equilibrium logic and nested logic programs: Reductions and complexity,, The complexity and generality of learning answer set programs, LARS: a logic-based framework for analytic reasoning over streams, Equilibrium logic, Combining answer set programming with description logics for the semantic web, Semantic forgetting in answer set programming, Outlier detection using default reasoning, Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation, Reasoning under minimal upper bounds in propositional logic, The complexity of computing minimal unidirectional covering sets, Modular Paracoherent Answer Sets, Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?, Abduction from logic programs: Semantics and complexity, $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols, Solution Enumeration by Optimality in Answer Set Programming, Lifted inference for statistical statements in probabilistic answer set programming, A general framework for preferences in answer set programming, When you must forget: Beyond strong persistence when forgetting in answer set programming, Dual-normal logic programs – the forgotten class, Rewriting recursive aggregates in answer set programming: back to monotonicity, Complexity and compilation of GZ-aggregates in answer set programming, Fuzzy answer set computation via satisfiability modulo theories, Solving stable matching problems using answer set programming, The power of non-ground rules in Answer Set Programming, Stable-unstable semantics: Beyond NP with normal logic programs, Justifications for programs with disjunctive and causal-choice rules, Thirty years of Epistemic Specifications, Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs, Beyond NP: Quantifying over Answer Sets, On Uniform Equivalence of Epistemic Logic Programs, Complexity results for answer set programming with bounded predicate arities and implications, On look-ahead heuristics in disjunctive logic programming, Design and results of the Fifth Answer Set Programming Competition, Solving problems in the polynomial hierarchy with ASP(Q), On the limits of forgetting in answer set programming, Handling and measuring inconsistency in non-monotonic logics, Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results, Computing Diverse Optimal Stable Models, Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs, Unnamed Item, Brave induction: a logical framework for learning from incomplete information, Implementing Prioritized Circumscription by Computing Disjunctive Stable Models, Finding explanations of inconsistency in multi-context systems, Brave Induction, An ASP approach for reasoning in a concept-aware multipreferential lightweight DL, FLP answer set semantics without circular justifications for general logic programs, Complexity-sensitive decision procedures for abstract argumentation, Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs, Complexity of super-coherence problems in ASP, Semantics and complexity of recursive aggregates in answer set programming, Bounded treewidth as a key to tractability of knowledge representation and reasoning, Inductive Negotiation in Answer Set Programming, Closed world assumption for disjunctive reasoning, New models for generating hard random Boolean formulas and disjunctive logic programs, Determining inference semantics for disjunctive logic programs, The Seventh Answer Set Programming Competition: Design and Results, Solving Advanced Argumentation Problems with Answer Set Programming, selp: A Single-Shot Epistemic Logic Program Solver, EMIL: extracting meaning from inconsistent language. Towards argumentation using a controlled natural language interface, Complexity results for probabilistic answer set programming, Complex optimization in answer set programming, Preface, Answer Set Programming: A Primer, Expressive power and complexity of partial models for disjunctive deductive databases, Relativized hyperequivalence of logic programs for modular programming, A multiparametric view on answer set programming, An abductive framework for negation in disjunctive logic programming, Strong inconsistency, The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17), Vicious circle principle, aggregates, and formation of sets in ASP based languages, Computing only minimal answers in disjunctive deductive databases, DynASP2.5: Dynamic Programming on Tree Decompositions in Action, Disjunctive logic programs, answer sets, and the cut rule, Detecting Inconsistencies in Large Biological Networks with Answer Set Programming, Declarative Semantics for Active Integrity Constraints, Propositional default logics made easier: computational complexity of model checking., Methods for solving reasoning problems in abstract argumentation -- a survey, Backdoors to tractable answer set programming, Possibilistic nested logic programs and strong equivalence, Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs, Determining Action Reversibility in STRIPS Using Answer Set and Epistemic Logic Programming, Logic programming and knowledge representation---The A-Prolog perspective, Extending and implementing the stable model semantics, Semi-equilibrium models for paracoherent answer set programs, Using possibilistic logic for modeling qualitative decision: answer set programming algorithms, Enhancing disjunctive logic programming systems by SAT checkers
Cites Work
- 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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
