725 search results - page 45 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
155
Voted
LICS
2003
IEEE
15 years 11 months ago
2003
IEEE
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
174
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL ) and for first-order logic with data equality tests (written F...
149
Voted
CSL
1999
Springer
15 years 10 months ago
1999
Springer
Hybrid languages are extended modal languages which can refer to (or even quantify over) states. Such languages are better behaved proof theoretically than ordinary modal languages...
168
click to vote
ISSTA
2000
ACM
15 years 10 months ago
2000
ACM
—Network protocols are often analyzed using simulations. We demonstrate how to extend such simulations to check propositions expressing safety properties of network event traces ...
151
Voted
LOPSTR
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. A formal and effective approach to the extension of the computational behaviour of logic programs is presented. The approach builds upon the following concepts. The exte...