851 search results - page 78 / 171 » Inaccessibility in Decision Procedures |
TPLP
2008
13 years 8 months ago
2008
We present in this paper a first-order axiomatization of an extended theory T of finite or infinite trees, built on a signature containing an infinite set of function symbols and ...
RTA
2009
Springer
14 years 3 months ago
2009
Springer
Most techniques to automatically disprove termination of term rewrite systems search for a loop. Whereas a loop implies nontermination for full rewriting, this is not necessarily t...
TABLEAUX
2009
Springer
14 years 3 months ago
2009
Springer
We present a terminating tableau calculus for graded hybrid logic with global modalities, reflexivity, transitivity and role hierarchies. Termination of the system is achieved thr...
AIMSA
2008
Springer
14 years 3 months ago
2008
Springer
Abstract. State of the art formalisms for distributed ontology integration provide ways to express semantic relations between concepts belonging to different ontologies. However, t...
CAV
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. While effective methods for bit-level verification of low-level properties exist, system-level properties that entail reasoning about a significant part of the design p...