98 search results - page 10 / 20 » Combinations of Theories for Decidable Fragments of First-Or... |
FOIS
2006
13 years 8 months ago
2006
In this paper we present methods to generate a Description Logic (DL) theory from a given First Order Logic (FOL) theory, such that each DL axiom is entailed by the given FOL theor...
CADE
2006
Springer
14 years 7 months ago
2006
Springer
Abstract. In the context of combinations of theories with disjoint signatures, we classify the component theories according to the decidability of constraint satisability problems ...
VSTTE
2012
Springer
12 years 2 months ago
2012
Springer
Motivated by the problem of deciding verification conditions for the verification of functional programs, we present new decision procedures for automated reasoning about functio...
IJCAI
2007
13 years 8 months ago
2007
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
RR
2009
Springer
14 years 1 months ago
2009
Springer
Open Answer Set Programming (OASP) can be seen as a framework to represent tightly integrated combined knowledge bases of ontologies and rules that are not necessarily DL-safe. The...