499 search results - page 77 / 100 » LTL satisfiability checking |
73
Voted
CADE
2010
Springer
14 years 10 months ago
2010
Springer
iProver-Eq is an implementation of an instantiation-based calculus Inst-Gen-Eq which is complete for first-order logic with equality. iProver-Eq extends the iProver system with sup...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. In general OASP is undecidable. In previous work we provided a tableau-based alg...
ENTCS
2010
14 years 9 months ago
2010
Program debugging is an extremely time-consuming process, and it takes up a large portion of software development time. In practice, debugging is still very much of an art, with t...
ECEASST
2008
14 years 9 months ago
2008
Abstract: In several rule-based applications using graph transformation as underlying modeling technique the following questions arise: How can one be sure that a specific sequence...