101 search results - page 3 / 21 » Some Progress in Satisfiability Checking for Difference Logi... |
DAC
2008
ACM
14 years 8 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
— In this paper, we consider the problem of robot motion planning in order to satisfy formulas expressible in temporal logics. Temporal logics naturally express traditional robot...
DAGSTUHL
2001
13 years 8 months ago
2001
A powerful approach to finding errors in computer software is to translate a given program into a verification condition, a logical formula that is valid if and only if the program...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
We investigate the computational complexity of reasoning about multi-agent systems using the cooperation logic ATL of Alur, Henzinger, and Kupferman. It is known that satisfiabili...
KBSE
2005
IEEE
14 years 29 days ago
2005
IEEE
We consider a formal framework for property verification of web applications using Spin model checker. Some of the web related properties concern all states of the model, while ot...