Sciweavers

232 search results - page 14 / 47
» Completeness and Decidability in Sequence Logic
Sort
View
IANDC
2007
132views more  IANDC 2007»
14 years 11 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
CORR
2008
Springer
107views Education» more  CORR 2008»
14 years 11 months ago
Metric Structures and Probabilistic Computation
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
Wesley Calvert
CONCUR
1998
Springer
15 years 4 months ago
Axioms for Real-Time Logics
This paper presents a complete axiomatization of two decidable propositional realtime linear temporal logics: Event Clock Logic (EventClockTL) and Metric Interval Temporal Logic w...
Jean-François Raskin, Pierre-Yves Schobbens...
DLOG
2010
14 years 9 months ago
Paraconsistent Description Logics Revisited
Abstract. Inconsistency handling is of growing importance in Knowledge Representation since inconsistencies may frequently occur in an open world. Paraconsistent (or inconsistency-...
Norihiro Kamide
PODS
2009
ACM
113views Database» more  PODS 2009»
16 years 8 days ago
Relative information completeness
The paper investigates the question of whether a partially closed database has complete information to answer a query. In practice an enterprise often maintains master data Dm, a ...
Wenfei Fan, Floris Geerts