Semantic forgetting in answer set programming

DOI10.1016/j.artint.2008.05.002zbMath1184.68159OpenAlexW2170482119MaRDI QIDQ2389674

Thomas Eiter, Kewen Wang

Publication date: 17 July 2009

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10072/26343

zbMATH Keywords

computational complexityknowledge representationforgettinganswer set programmingnonmonotonic logic programs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Knowledge representation (68T30) Logic programming (68N17)

Related Items (20)

ELIMINATING CONCEPTS AND ROLES FROM ONTOLOGIES IN EXPRESSIVE DESCRIPTIVE LOGICS ⋮ Preserving Strong Equivalence while Forgetting ⋮ Forgetting for knowledge bases in DL-lite ⋮ When you must forget: Beyond strong persistence when forgetting in answer set programming ⋮ Knowledge forgetting in propositional \(\mu\)-calculus ⋮ Logic-based ontology comparison and module extraction, with an application to DL-Lite ⋮ A Syntactic Operator for Forgetting that Satisfies Strong Persistence ⋮ Computing sufficient and necessary conditions in CTL: a forgetting approach ⋮ On the limits of forgetting in answer set programming ⋮ A logic-algebraic tool for reasoning with knowledge-based systems ⋮ Towards closed world reasoning in dynamic open worlds ⋮ Reasoning under inconsistency: a forgetting-based approach ⋮ Omission-Based Abstraction for Answer Set Programs ⋮ On syntactic forgetting under uniform equivalence ⋮ Mathematical Logic for Life Science Ontologies ⋮ A model of three-way decisions for knowledge harnessing ⋮ Forgetting in ASP: The Forgotten Properties ⋮ Forgetting in multi-agent modal logics ⋮ Knowledge forgetting: properties and applications ⋮ On Quantifying Literals in Boolean Logic and its Applications to Explainable AI

Uses Software

• ASSAT

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
• Unnamed Item
• Lazy narrowing: strong completeness and eager variable elimination
• ASSAT: computing answer sets of a logic program by SAT solvers
• Computational aspects of monotone dualization: a brief survey
• Semantical considerations on nonmonotonic logic
• A logic for default reasoning
• Circumscription - a form of non-monotonic reasoning
• View updates in stratified disjunctive databases
• Revision programming
• Answer set programming and plan generation
• Preprocessing of intractable problems
• On the computational cost of disjunctive logic programming: Propositional case
• Propositional semantics for disjunctive logic programs
• Nested expressions in logic programs
• Solving logic program conflict through strong and weak forgettings
• Negation as failure in the head
• Autoepistemic logic
• Characterizations of the disjunctive stable semantics by partial evaluation
• The complexity of logic-based abduction
• Disjunctive logic programs with inheritance
• On properties of update sequences based on causal rejection
• Dynamic updates of non-monotonic knowledge bases
• Tight logic programs
• An abductive framework for computing knowledge base updates
• Logic Programming
• Logic Programming
• Comparisons and computation of well-founded semantics for disjunctive logic programs
• Logic program-based updates
• The DLV system for knowledge representation and reasoning
• Semantical characterizations and complexity of equivalences in answer set programming
• Forgetting Literals with Varying Propositional Symbols
• Strongly equivalent logic programs
• On strongest necessary and weakest sufficient conditions

This page was built for publication: Semantic forgetting in answer set programming