Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
type: Item
instance of: scholarly article
title: Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
zbMATH Open document ID: 1209.68101
published in: Artificial Intelligence
publication date: 2011-01-31T00:00:00Z
Mathematics Subject Classification ID: 68N17
Mathematics Subject Classification ID: 68Q55
zbMATH DE Number: 5843089
zbMATH Keywords: logic programming
zbMATH Keywords: stable models
zbMATH Keywords: supported models
zbMATH Keywords: reducts
zbMATH Keywords: logic HT
author: Mirosław Truszczyński
describes a project that uses: CCalc
describes a project that uses: Cmodels
describes a project that uses: ASSAT
describes a project that uses: Smodels
describes a project that uses: ANTON
MaRDI profile type: Publication
full work available at URL: j.artint.2010.08.004
OpenAlex ID: W2072190298
cites work: Q4385536
cites work: Answer set based design of knowledge systems
cites work: Characterizations of the disjunctive stable semantics by partial evaluation
cites work: Propositional theories are strongly equivalent to logic programs
cites work: Combining Nonmonotonic Knowledge Bases with External Sources
cites work: Q4434167
cites work: A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system
cites work: Semantical characterizations and complexity of equivalences in answer set programming
cites work: On the computational cost of disjunctive logic programming: Propositional case
cites work: Logics in Artificial Intelligence
cites work: Design and implementation of aggregate functions in the DLV system
cites work: Logic Programming and Nonmonotonic Reasoning
cites work: Weight constraints as nested expressions
cites work: Q3007261
cites work: Logic programming and knowledge representation---The A-Prolog perspective
cites work: Q3983043
cites work: Nonmonotonic causal theories
cites work: Negation as failure in the head
cites work: On Reductive Semantics of Aggregates in Answer Set Programming
cites work: Abstract Answer Set Solvers
cites work: Strongly equivalent logic programs
cites work: Nested expressions in logic programs
cites work: Q4702577
cites work: The relationship between stable, supported, default and autoepistemic semantics for general logic programs
cites work: Autoepistemic logic
cites work: Semantical considerations on nonmonotonic logic
cites work: Logic programs with stable model semantics as a constraint programming paradigm
cites work: Extending the Smodels system with cardinality and weight constraints
cites work: Quantified Equilibrium Logic and Foundations for Answer Set Programs
cites work: Logic Programming for Multiagent Planning with Negotiation
cites work: Hyperequivalence of logic programs with respect to supported models
cites work: Reasoning and planning with sensing actions, incomplete information, and static causal laws using answer set programming
cites work: Strong equivalence made easy: nested expressions and weight constraints
cites work: A common view on strong, uniform, and other notions of equivalence in answer-set programming
DOI: 10.1016/J.ARTINT.2010.08.004
Recommended article: Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
Recommended article: Q4413066
Recommended article: Q4809790
Recommended article: A computable semantics for general logic programs
Recommended article: Reduction of provability logics to Σ1-provability logics
Recommended article: A general relational semantics of propositional logic: axiomatization
Recommended article: Generalized Quantifiers and Logical Reducibilities
Recommended article: Logic for Programming, Artificial Intelligence, and Reasoning
Recommended article: Q3212265
Recommended article: On the declarative and procedural semantics of logic programs
description: scientific article; zbMATH DE number 5843089