Sciweavers

834 search results - page 9 / 167
» Computing Minimal Models, Stable Models, and Answer Sets
Sort
View
113
Voted
ATVA
2008
Springer
121views Hardware» more  ATVA 2008»
15 years 1 months ago
Model Based Importance Analysis for Minimal Cut Sets
We show how fault injection together with recent advances in stochastic model checking can be combined to form a crucial ingredient for improving quantitative safety analysis. Base...
Eckard Böde, Thomas Peikenkamp, Jan Rakow, Sa...
111
Voted
FOIKS
2008
Springer
15 years 1 months ago
Alternative Characterizations for Program Equivalence under Answer-Set Semantics Based on Unfounded Sets
Logic programs under answer-set semantics constitute an important tool for declarative problem solving. In recent years, two research issues received growing attention. On the one ...
Martin Gebser, Torsten Schaub, Hans Tompits, Stefa...
98
Voted
ICLP
2007
Springer
15 years 5 months ago
Minimal Logic Programs
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
Pedro Cabalar, David Pearce, Agustín Valver...
186
Voted
ICLP
2009
Springer
16 years 9 days ago
Merging Logic Programs under Answer Set Semantics
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
James P. Delgrande, Torsten Schaub, Hans Tompits, ...
CORR
2008
Springer
110views Education» more  CORR 2008»
14 years 11 months ago
Justifications for Logic Programs under Answer Set Semantics
The paper introduces the notion of off-line justification for Answer Set Programming (ASP). Justifications provide a graph-based explanation of the truth value of an atom w.r.t. a ...
Enrico Pontelli, Tran Cao Son, Omar El-Khatib