3119 search results - page 42 / 624 » General Default Logic |
CAV
2009
Springer
14 years 2 months ago
2009
Springer
The DPLL approach to the Boolean satisfiability problem (SAT) is a combination of search for a satisfying assignment and logical deduction, in which each process guides the other....
FOSSACS
2007
Springer
13 years 11 months ago
2007
Springer
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of tempora...
VL
2007
IEEE
14 years 1 months ago
2007
IEEE
Interval-valued computation is an unconventional computing paradigm. It is an idealization of classical 16-, 32-, 64- etc. bit based computations. It represents data as specific ...
CL
2000
Springer
14 years 20 hour ago
2000
Springer
ISCAS
1993
IEEE
13 years 11 months ago
1993
IEEE