1814 search results - page 164 / 363 » Extended First-Order Logic |
143
click to vote
CSL
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
175
Voted
DLT
2009
15 years 1 months ago
2009
Abstract. Temporal logics are a well investigated formalism for the specification and verification of reactive systems. Using formal verification techniques, we can ensure the corr...
131
Voted
ECAI
1998
Springer
15 years 7 months ago
1998
Springer
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
126
click to vote
CADE
2009
Springer
16 years 4 months ago
2009
Springer
The Thousands of Problems for Theorem Provers (TPTP) problem library is the basis of a well established infrastructure supporting research, development, and deployment of first-ord...
131
Voted
QEST
2007
IEEE
15 years 9 months ago
2007
IEEE
We investigate logics and equivalence relations that capture the qualitative behavior of Markov Decision Processes (MDPs). We present Qualitative Randomized Ctl (Qrctl): formulas o...