On the computational cost of disjunctive logic programming: Propositional case
From MaRDI portal
Publication:1924780
DOI10.1007/BF01536399zbMATH Open0858.68016WikidataQ59259761 ScholiaQ59259761MaRDI QIDQ1924780
Publication date: 25 March 1997
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Propositional semantics for disjunctive logic programs
- The well-founded semantics for general logic programs
- Autoepistemic logic
- The complexity of model checking for circumscriptive formulae
- Bounded Query Classes
- A logic for default reasoning
- Semantical considerations on nonmonotonic logic
- On the relationship between circumscription and negation as failure
- Circumscription - a form of non-monotonic reasoning
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
- Negation as failure: careful closure procedure
- Deduction in non-Horn databases
- Complexity Results for Nonmonotonic Logics
- Hard problems for simple default logics
- The complexity of propositional closed world reasoning and circumscription
- Horn clause queries and generalizations
- A survey of complexity results for non-monotonic logics
- Inferring negative information from disjunctive databases
- General logical databases and programs: Default logic semantics and stratification
- Three-valued nonmonotonic formalisms and semantics of logic programs
- How complicated is the set of stable models of a recursive logic program?
- A theory of nonmonotonic rule systems. II
- Weak generalized closed world assumption
- Negation by default and unstratifiable logic programs
- Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete
- The expressiveness of locally stratified programs
- Generalized disjunctive well-founded semantics for logic programs.
Cited In (only showing first 100 items - show all)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning
- Semi-equilibrium models for paracoherent answer set programs
- Abduction from logic programs: Semantics and complexity
- Semantics and complexity of recursive aggregates in answer set programming
- Well-Supported Semantics for Logic Programs with Generalized Rules
- When you must forget: Beyond strong persistence when forgetting in answer set programming
- Outlier detection using default reasoning
- Relativized hyperequivalence of logic programs for modular programming
- Possibilistic nested logic programs and strong equivalence
- Towards logical operations research -- propositional case
- Answer Set Programming: A Primer
- Equilibrium logic
- Characterising equilibrium logic and nested logic programs: Reductions and complexity,
- On elementary loops of logic programs
- Stable-unstable semantics: Beyond NP with normal logic programs
- Brave Induction
- Inductive Negotiation in Answer Set Programming
- Evaluating epistemic negation in answer set programming
- An ASP approach for reasoning in a concept-aware multipreferential lightweight DL
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)
- LARS: a logic-based framework for analytic reasoning over streams
- Declarative Semantics for Active Integrity Constraints
- Expressive power and complexity of partial models for disjunctive deductive databases
- Equivalence issues in abduction and induction
- Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- Extending and implementing the stable model semantics
- Finding explanations of inconsistency in multi-context systems
- Reasoning under minimal upper bounds in propositional logic
- Disjunctive Programs with Set Constraints
- Complex optimization in answer set programming
- The Seventh Answer Set Programming Competition: Design and Results
- Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
- Fuzzy answer set computation via satisfiability modulo theories
- Learning Boolean controls in regulated metabolic networks: a case-study
- Propositional default logics made easier: computational complexity of model checking.
- Disjunctive logic programs, answer sets, and the cut rule
- The complexity and generality of learning answer set programs
- Backdoors to Normality for Disjunctive Logic Programs
- The complexity of computing minimal unidirectional covering sets
- Progress in clasp Series 3
- A general framework for preferences in answer set programming
- Brave induction: a logical framework for learning from incomplete information
- Combining answer set programming with description logics for the semantic web
- Vicious circle principle, aggregates, and formation of sets in ASP based languages
- DynASP2.5: Dynamic Programming on Tree Decompositions in Action
- Active integrity constraints and revision programming
- Design and results of the Fifth Answer Set Programming Competition
- Determining Action Reversibility in STRIPS Using Answer Set and Epistemic Logic Programming
- Complexity-sensitive decision procedures for abstract argumentation
- Modular Paracoherent Answer Sets
- Using possibilistic logic for modeling qualitative decision: answer set programming algorithms
- Backdoors to Satisfaction
- On the limits of forgetting in answer set programming
- Computing only minimal answers in disjunctive deductive databases
- FLP answer set semantics without circular justifications for general logic programs
- Solving stable matching problems using answer set programming
- Backdoors to tractable answer set programming
- Detecting and repairing anomalous evolutions in noisy environments. Logic programming formalization and complexity results
- Solving Advanced Argumentation Problems with Answer Set Programming
- Logic programming and knowledge representation---The A-Prolog perspective
- $\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols
- Handling and measuring inconsistency in non-monotonic logics
- Semantic forgetting in answer set programming
- Logic Programming with Graded Modality
- Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
- Enhancing disjunctive logic programming systems by SAT checkers
- Complexity and compilation of GZ-aggregates in answer set programming
- Rewriting recursive aggregates in answer set programming: back to monotonicity
- Methods for solving reasoning problems in abstract argumentation -- a survey
- Complexity results for probabilistic answer set programming
- Complexity results for answer set programming with bounded predicate arities and implications
- Strong inconsistency
- Utilizing Treewidth for Quantitative Reasoning on Epistemic Logic Programs
- Detecting Inconsistencies in Large Biological Networks with Answer Set Programming
- On Uniform Equivalence of Epistemic Logic Programs
- The power of non-ground rules in Answer Set Programming
- Beyond NP: Quantifying over Answer Sets
- Thirty years of Epistemic Specifications
- Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs
- Computing Diverse Optimal Stable Models
- Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
- A multiparametric view on answer set programming
- Witnesses for Answer Sets of Logic Programs
- Dual-normal logic programs – the forgotten class
- Title not available (Why is that?)
- Lifted inference for statistical statements in probabilistic answer set programming
- Solution Enumeration by Optimality in Answer Set Programming
- selp: A Single-Shot Epistemic Logic Program Solver
- An abductive framework for negation in disjunctive logic programming
- Computational complexity of minimal trap spaces in Boolean networks
- Treewidth-aware reductions of normal \textsc{ASP} to \textsc{SAT} - is normal \textsc{ASP} Harder than \textsc{SAT} after all?
- Preface
- New models for generating hard random Boolean formulas and disjunctive logic programs
- Determining inference semantics for disjunctive logic programs
- EMIL: extracting meaning from inconsistent language. Towards argumentation using a controlled natural language interface
- Solving problems in the polynomial hierarchy with ASP(Q)
- Adaptive large-neighbourhood search for optimisation in answer-set programming
- Complexity of super-coherence problems in ASP
- Closed world assumption for disjunctive reasoning
This page was built for publication: On the computational cost of disjunctive logic programming: Propositional case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924780)
