Sciweavers

247 search results - page 9 / 50
» A Proof System and a Decision Procedure for Equality Logic
Sort
View
IANDC
2007
132views more  IANDC 2007»
13 years 7 months ago
An automata-theoretic approach to constraint LTL
We consider an extension of linear-time temporal logic (LTL) with constraints interpreted over a concrete domain. We use a new automata-theoretic technique to show pspace decidabi...
Stéphane Demri, Deepak D'Souza
CADE
2010
Springer
13 years 5 months ago
Terminating Tableaux for Hybrid Logic with Eventualities
x-free and employs a novel clausal form that abstracts away from propositional reasoning. It comes with an elegant correctness proof. We discuss some optimizations for decision pro...
Mark Kaminski, Gert Smolka
IJCAI
1997
13 years 8 months ago
On Evaluating Decision Procedures for Modal Logic
This paper investigates the evaluation method of decision procedures for multi-modal logic proposed by Giunchiglia and Sebastiani as an adaptation from the evaluation method of Mi...
Ullrich Hustadt, Renate A. Schmidt
DAGSTUHL
2007
13 years 9 months ago
Decision Procedures for Loop Detection
Abstract. The dependency pair technique is a powerful modular method for automated termination proofs of term rewrite systems. We first show that dependency pairs are also suitabl...
René Thiemann, Jürgen Giesl, Peter Sch...
ICLP
2007
Springer
14 years 1 months ago
Logic Programming Approach to Automata-Based Decision Procedures
We propose a novel technique that maps decision problems in WS1S (weak monadic second-order logic with n successors) to the problem of query evaluation of Complex-value Datalog que...
Gulay Ünel, David Toman