Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs

DOI10.1016/j.artint.2010.08.004zbMath1209.68101OpenAlexW2072190298MaRDI QIDQ622117

Miroslaw Truszczynski

Publication date: 31 January 2011

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

Full work available at URL: https://doi.org/10.1016/j.artint.2010.08.004

zbMATH Keywords

logic programmingreductsstable modelslogic HTsupported models

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Logic programming (68N17)

Related Items (10)

Evaluating epistemic negation in answer set programming ⋮ Well-Supported Semantics for Logic Programs with Generalized Rules ⋮ Model-based recasting in answer-set programming ⋮ Relating Two Dialects of Answer Set Programming ⋮ Stepwise debugging of answer-set programs ⋮ On the limits of forgetting in answer set programming ⋮ FLP answer set semantics without circular justifications for general logic programs ⋮ Determining inference semantics for disjunctive logic programs ⋮ Inlining External Sources in Answer Set Programs ⋮ Forgetting in ASP: The Forgotten Properties

Uses Software

• ASSAT
• Cmodels
• Smodels
• CCalc
• ANTON

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
• Nonmonotonic causal theories
• Answer set based design of knowledge systems
• Hyperequivalence of logic programs with respect to supported models
• Semantical considerations on nonmonotonic logic
• The relationship between stable, supported, default and autoepistemic semantics for general logic programs
• Logic programming and knowledge representation---The A-Prolog perspective
• On the computational cost of disjunctive logic programming: Propositional case
• Logic programs with stable model semantics as a constraint programming paradigm
• Nested expressions in logic programs
• Design and implementation of aggregate functions in the DLV system
• On Reductive Semantics of Aggregates in Answer Set Programming
• Combining Nonmonotonic Knowledge Bases with External Sources
• Negation as failure in the head
• Autoepistemic logic
• Characterizations of the disjunctive stable semantics by partial evaluation
• Logic Programming for Multiagent Planning with Negotiation
• Weight constraints as nested expressions
• Strong equivalence made easy: nested expressions and weight constraints
• Semantical characterizations and complexity of equivalences in answer set programming
• Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming
• Logics in Artificial Intelligence
• Logic Programming and Nonmonotonic Reasoning
• Propositional theories are strongly equivalent to logic programs
• A common view on strong, uniform, and other notions of equivalence in answer-set programming
• Logic Programming and Nonmonotonic Reasoning
• Abstract Answer Set Solvers
• Quantified Equilibrium Logic and Foundations for Answer Set Programs
• Strongly equivalent logic programs

This page was built for publication: Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs