622 search results - page 34 / 125 » Answer Set Programming and Bounded Model Checking |
LPNMR
2007
Springer
14 years 2 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 ...
DLOG
2006
13 years 9 months ago
2006
The novel context of accessing and querying large data repositories through ontologies that are formalized in terms of expressive DLs requires on the one hand to consider query an...
ICCAD
1996
IEEE
14 years 6 days ago
1996
IEEE
Based Automatic Abstraction for CTL Model Checking Woohyuk Lee Abelardo Pardo Jae-Young Jang Gary Hachtel Fabio Somenzi University of Colorado ECEN Campus Box 425 Boulder, CO, 8030...
FORTE
2008
13 years 9 months ago
2008
Model programs represent transition systems that are used fy expected behavior of systems at a high level of abstraction. The main application area is application-level network pro...
FORMATS
2006
Springer
13 years 11 months ago
2006
Springer
In this paper we describe an extension of timed automata with priorities, and efficient algorithms to compute subtraction on DBMs (difference bounded matrices), needed in symbolic ...