15 search results - page 3 / 3 » The Decidability of the First-Order Theory of Knuth-Bendix O... |
CAV
2009
Springer
14 years 8 months ago
2009
Springer
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...
FOIS
2006
13 years 9 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...
TACAS
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We extend the setting of Satisfiability Modulo Theories (SMT) by introducing a theory of costs C, where it is possible to model and reason about resource consumption and ...
CSCLP
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
IJCAI
2003
13 years 8 months ago
2003
We overview the development of first-order automated reasoning systems starting from their early years. Based on the analysis of current and potential applications of such systems...