1941 search results - page 201 / 389 » Reasoning about Computations Using Two-Levels of Logic |
125
Voted
BIRTHDAY
2010
Springer
15 years 4 months ago
2010
Springer
Stable models of logic programs have been studied by many researchers, mainly because of their role in the foundations of answer set programming. This is a review of some of the de...
123
Voted
LICS
2005
IEEE
15 years 9 months ago
2005
IEEE
Three-valued models, in which properties of a system are either true, false or unknown, have recently been advocated as a better representation for reactive program abstractions g...
128
Voted
DAC
2006
ACM
16 years 4 months ago
2006
ACM
SAT sweeping is a method for simplifying an AND/INVERTER graph (AIG) by systematically merging graph vertices from the inputs towards the outputs using a combination of structural...
138
click to vote
TIME
2007
IEEE
15 years 10 months ago
2007
IEEE
We present a symbolic algorithm for deciding safety (reachability) of timed systems modelled as Timed Automata (TA), under the notion of robustness w.r.t. infinitesimal clock-drif...
119
click to vote
ECAI
2004
Springer
15 years 7 months ago
2004
Springer
In this paper, we tackle the satisfiability problem for multi-context systems. First, we establish a satisfiability algorithm based on an encoding into propositional logic. Then, w...