Sciweavers

ESOP
2008
Springer
14 years 29 days ago
Iterative Specialisation of Horn Clauses
Abstract. We present a generic algorithm for solving Horn clauses through iterative specialisation. The algorithm is generic in the sense that it can be instantiated with any decid...
Christoffer Rosenkilde Nielsen, Flemming Nielson, ...
DALT
2009
Springer
14 years 2 months ago
Computing Utility from Weighted Description Logic Preference Formulas
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...
Azzurra Ragone, Tommaso Di Noia, Francesco M. Doni...
TABLEAUX
1998
Springer
14 years 3 months ago
A Tableau Calculus for Quantifier-Free Set Theoretic Formulae
Abstract. Set theory is the common language of mathematics. Therefore, set theory plays an important r^ole in many important applications of automated deduction. In this paper, we ...
Bernhard Beckert, Ulrike Hartmer
CHARME
2003
Springer
97views Hardware» more  CHARME 2003»
14 years 4 months ago
Convergence Testing in Term-Level Bounded Model Checking
We consider the problem of bounded model checking of systems expressed in a decidable fragment of first-order logic. While model checking is not guaranteed to terminate for an ar...
Randal E. Bryant, Shuvendu K. Lahiri, Sanjit A. Se...