Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- 30 November 2010
- journal article
- Published by Elsevier in Artificial Intelligence
- Vol. 174 (16-17) , 1285-1306
Abstract
No abstract availableKeywords
This publication has 43 references indexed in Scilit:
- Hyperequivalence of logic programs with respect to supported modelsAnnals of Mathematics and Artificial Intelligence, 2008
- A common view on strong, uniform, and other notions of equivalence in answer-set programmingTheory and Practice of Logic Programming, 2008
- A knowledge based approach for representing and reasoning about signaling networksBioinformatics, 2004
- ASSAT: computing answer sets of a logic program by SAT solversArtificial Intelligence, 2004
- Strong equivalence made easy: nested expressions and weight constraintsTheory and Practice of Logic Programming, 2003
- A logic programming approach to knowledge-state planning, II: The systemArtificial Intelligence, 2003
- Negation as failure in the headThe Journal of Logic Programming, 1998
- Characterizations of the disjunctive stable semantics by partial evaluationThe Journal of Logic Programming, 1997
- A new logical characterisation of stable models and answer sets1997
- Autoepistemic logicJournal of the ACM, 1991