499 search results - page 55 / 100 » LTL satisfiability checking |
118
click to vote
BIRTHDAY
2004
Springer
15 years 3 months ago
2004
Springer
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
125
click to vote
DLOG
1998
15 years 1 months ago
1998
Effective systems for expressive description logics require a heavily-optimised subsumption checker incorporating a range of optimisation techniques. Because of the correspondence...
ICLP
2004
Springer
15 years 5 months ago
2004
Springer
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...
FCS
2006
15 years 1 months ago
2006
-- Boolean SAT problems are widespread in current demanding applications, most notably model checking for both hardware and software. It has long been known that the clause-to-vari...
ACSD
2003
IEEE
15 years 3 months ago
2003
IEEE
Abstract. The behaviour of asynchronous circuits is often described by Signal Transition Graphs (STGs), which are Petri nets whose transitions are interpreted as rising and falling...