276 search results - page 3 / 56 » Representing Transition Systems by Logic Programs |
AAAI
2000
13 years 6 months ago
2000
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional ...
AIPS
2003
13 years 6 months ago
2003
Symmetries are inherent in systems that consist of several interchangeable objects or components. When reasoning about such systems, big computational savings can be obtained if t...
IFIP
2005
Springer
13 years 10 months ago
2005
Springer
Recently, opacity has proved to be a promising technique for describing security properties. Much of the work has been couched in terms of Petri nets. Here, we extend the notion of...
RTA
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
TASE
2008
IEEE
13 years 11 months ago
2008
IEEE
We present a thorough study of Propositional Dynamic Logic over a variation of labeled transition systems, called accelerated labelled transition systems, which are transition sys...