851 search results - page 66 / 171 » Inaccessibility in Decision Procedures |
AIML
2008
13 years 10 months ago
2008
In this paper we define a many-valued semantics for hybrid logic and we give a sound and complete tableau system which is prooftheoretically well-behaved, in particular, it gives r...
ICFP
2010
ACM
13 years 10 months ago
2010
ACM
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
IANDC
2006
13 years 9 months ago
2006
Many approaches to deciding the satisfiability of quantifier free formulae with respect to a background theory T -- also known as Satisfiability Modulo Theory, or SMT
JELIA
2010
Springer
13 years 6 months ago
2010
Springer
In the field of non-monotonic logics, the notion of rational closure is acknowledged as a landmark, and we are going to see that such a construction can be characterised by means o...
SEMWEB
2010
Springer
13 years 6 months ago
2010
Springer
This paper presents our work on supporting evaluation of integrity constraint issues in semantic web instance data. We propose an alternative semantics for the ontology language, i...