Abduction from logic programs: Semantics and complexity

DOI10.1016/S0304-3975(96)00179-XzbMATH Open0893.68022MaRDI QIDQ1389684FDOQ1389684

N. Leone, Thomas Eiter, Georg Gottlob

Publication date: 30 June 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

knowledge representationreasoning

Mathematics Subject Classification ID

Logic programming (68N17)

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?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• LOGIDATA+: deductive databases with complex objects
• On the computational cost of disjunctive logic programming: Propositional case
• The well-founded semantics for general logic programs
• Abductive Logic Programming
• Autoepistemic logic
• Second order logic and the weak exponential hierarchies
• A logic for default reasoning
• Non-monotonic logic. I
• Semantical considerations on nonmonotonic logic
• Circumscription - a form of non-monotonic reasoning
• Classifying the computational complexity of problems
• Logic programming and knowledge representation
• The computational complexity of abduction
• The complexity of propositional closed world reasoning and circumscription
• The complexity of logic-based abduction
• On the Relationship Between Abduction and Deduction
• A survey of complexity results for non-monotonic logics
• SLDNFA: An abductive procedure for abductive logic programs
• Representing Incomplete Knowledge in Abductive Logic Programming
• General logical databases and programs: Default logic semantics and stratification
• Stable and extension class theory for logic programs and default logics
• On the relations between stable and well-founded semantics of logic programs
• The expressive powers of the logic programming semantics
• The expressive power of stratified logic programs
• Abduction versus closure in causal theories.
• Complexity and undecidability results for logic programming
• On the greedy algorithm for satisfiability
• An alternative approach to the semantics of disjunctive logic programs and deductive databases
• Generalized disjunctive well-founded semantics for logic programs.
• An abductive framework for extended logic programming

Cited In (39)

• Abduction in well-founded semantics and generalized stable models via tabled dual programs
• Compilability of propositional abduction
• Outlier detection using default reasoning
• Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions
• The hardness of resilience for nested aggregation query
• Semi-negative Abductive Logic Programs with Implicative Integrity Constraints: Semantics and Properties
• Abductive Logic Grammars
• Brave Induction
• The power of non-ground rules in Answer Set Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Inconsistency Management for Traffic Regulations: Formalization and Complexity Results
• On computing all abductive explanations from a propositional Horn theory
• A Measure of Arbitrariness in Abductive Explanations
• Succinctness as a source of complexity in logical formalisms
• Logical form generation as abduction: Part II. A dual-route parsimonious covering approach
• Prioritized logic programming and its application to commonsense reasoning
• Causes for query answers from databases: datalog abduction, view-updates, and integrity constraints
• Foundations of Information and Knowledge Systems
• The Complexity of Abduction for Equality Constraint Languages
• A general framework for preferences in answer set programming
• Brave induction: a logical framework for learning from incomplete information
• Default reasoning from conditional knowledge bases: Complexity and tractable cases
• What makes propositional abduction tractable
• Bi-Abduction with Pure Properties for Specification Inference
• On the complexity of second-best abductive explanations
• From causes for database queries to repairs and model-based diagnosis and back
• Using possibilistic logic for modeling qualitative decision: answer set programming algorithms
• The complexity class θp2: Recent results and applications in AI and modal logic
• The View-Update Problem for Indefinite Databases
• Indefinite abductive explanations
• Inference to the stable explanations
• Teleo-Reactive Abductive Logic Programs
• Title not available (Why is that?)
• Contrastive explanations for answer-set programs
• Complexity results for explanations in the structural-model approach
• Scalable algorithms for abduction via enumerative syntax-guided synthesis
• Abductive logic programming and disjunctive logic programming: their relationship and transferability
• Hypothesizing about signaling networks

Uses Software

• Datalog

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Abductive Logic Programming 👍 👎
• Semantics and complexity of abduction from default theories 👍 👎
• The complexity of logic-based abduction 👍 👎
• A terminological interpretation of (abductive) logic programming 👍 👎
• An abductive approach to disjunctive logic programming 👍 👎
• Complexity results for abductive logic programming 👍 👎
• An abductive framework for extended logic programming 👍 👎

This page was built for publication: Abduction from logic programs: Semantics and complexity

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