60 search results - page 4 / 12 » Loop Formulas for Circumscription |
AI
2004
Springer
13 years 7 months ago
2004
Springer
We propose a new translation from normal logic programs with constraints under the answer set semantics to propositional logic. Given a normal logic program, we show that by addin...
LPNMR
2009
Springer
14 years 6 days ago
2009
Springer
Several proposals of the semantics of aggregates are based on different extensions of the stable model semantics, which makes it difficult to compare them. In this note, building ...
LPNMR
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. The recently proposed notion of an elementary set yielded a refinement of the theorem on loop formulas, telling us that the stable models of a disjunctive logic program ...
SOFSEM
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
TCOM
2010
13 years 2 months ago
2010
The performance of an automatic frequency control (AFC) loop is investigated using two measures, the mean time to loss of lock and the average switching rate. The AFC is considere...