Sciweavers

156 search results - page 12 / 32
» Decidability and Undecidability in Probability Logic
Sort
View
IANDC
2007
132views more  IANDC 2007»
13 years 8 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
SEMWEB
2004
Springer
14 years 1 months ago
Query Answering for OWL-DL with Rules
Both OWL-DL and function-free Horn rules3 are decidable logics with interesting, yet orthogonal expressive power: from the rules perspective, OWL-DL is restricted to tree-like rule...
Boris Motik, Ulrike Sattler, Rudi Studer
IJCAI
2003
13 years 10 months ago
Decidability of SHIQ with Complex Role Inclusion Axioms
Motivated by medical terminology applications, we investigate the decidability of the well known expressive DL, SHIQ, extended with role inclusion axioms (RIAs) of the form R ◦ ...
Ian Horrocks, Ulrike Sattler
AIML
2006
13 years 10 months ago
From topology to metric: modal logic and quantification in metric spaces
We propose a framework for comparing the expressive power and computational behaviour of modal logics designed for reasoning about qualitative aspects of metric spaces. Within this...
Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter,...
CAV
2009
Springer
163views Hardware» more  CAV 2009»
14 years 9 months ago
Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories
Quantifier reasoning in Satisfiability Modulo Theories (SMT) is a long-standing challenge. The practical method employed in modern SMT solvers is to instantiate quantified formulas...
Leonardo Mendonça de Moura, Yeting Ge