499 search results - page 70 / 100 » LTL satisfiability checking |
GIS
2008
ACM
15 years 27 days ago
2008
ACM
One of the formalisms to qualitatively describe polylines in the plane are double-cross matrices. In a double-cross matrix the relative position of any two line segments in a poly...
107
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Many problems in mathematics and computer science can be reduced to proving the satisfiability of conjunctions of literals in a background theory which is often the extension of a ...
IJMMS
2007
14 years 11 months ago
2007
Personal information and organizational information need to be protected, which requires that only authorized users gain access to the information. The most commonly used method f...
109
click to vote
VMCAI
2009
Springer
15 years 6 months ago
2009
Springer
There has been a lot of recent research on transaction-based concurrent programming, aimed at offering an easier concurrent programming paradigm that enables programmers to better...
AI
2005
Springer
14 years 11 months ago
2005
Springer
We consider the problem of how an agent's knowledge can be updated. We propose a formal method of knowledge update on the basis of the semantics of modal logic S5. In our met...