186 search results - page 4 / 38 » Decidable Extensions of Church's Problem |
SEFM
2006
IEEE
14 years 3 months ago
2006
IEEE
The key to many approaches to reason about pointerbased data structures is the availability of a decision procedure to automatically discharge proof obligations in a theory encomp...
MDAI
2007
Springer
14 years 3 months ago
2007
Springer
We take institutions seriously as both a rational response to dilemmas in which agents found themselves and a frame to which later rational agents adapted their behaviour in turn....
SAT
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. SAT Modulo Theories (SMT) consists of deciding the satisfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vect...
CADE
2010
Springer
13 years 10 months ago
2010
Springer
We propose an extension of the syntactic restriction for complex role inclusion axioms in the description logic SROIQ. Like the original restriction in SROIQ, our restrictions can ...
FROCOS
2007
Springer
14 years 3 months ago
2007
Springer
In abstract algebra, a structure is said to be Noetherian if it does not admit infinite strictly ascending chains of congruences. In this paper, we adapt this notion to first-ord...