193 search results - page 8 / 39 » Dynamical Properties of Answer Set Programs |
LPNMR
2007
Springer
14 years 3 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 ...
JELIA
2010
Springer
13 years 8 months ago
2010
Springer
Action languages allow for compactly describing dynamic domains. They are usually implemented by compilation, e.g., to Answer Set Programming. To this end, we developed a tool, cal...
ECAI
2000
Springer
14 years 2 months ago
2000
Springer
Abstract. We describe an approach for compiling dynamic preferences into logic programs under the answer set semantics. An ordered logic program is an extended logic program in whi...
ACSD
2006
IEEE
14 years 3 months ago
2006
IEEE
A schedule of a Petri Net (PN) represents a set of firing sequences that can be infinitely repeated within a bounded state space, regardless of the outcomes of the nondeterminis...
FMICS
2008
Springer
13 years 11 months ago
2008
Springer
Given the intractability of exhaustively verifying software, the use of runtime-verification, to verify single execution paths at runtime, is becoming popular. Although the use of ...