Sciweavers

14 search results - page 1 / 3
» An Efficient Decision Procedure for Functional Decomposable ...
Sort
View
CSCLP
2008
Springer
13 years 6 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
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,...
Khalil Djelloul
ENTCS
2006
124views more  ENTCS 2006»
13 years 5 months ago
An Efficient Nelson-Oppen Decision Procedure for Difference Constraints over Rationals
Abstract. Nelson and Oppen provided a methodology for modularly combining decision procedures for individual theories to construct a decision procedure for a combination of theorie...
Shuvendu K. Lahiri, Madanlal Musuvathi
CADE
2004
Springer
14 years 5 months ago
Decision Procedures for Recursive Data Structures with Integer Constraints
This paper is concerned with the integration of recursive data structures with Presburger arithmetic. The integrated theory includes a length function on data structures, thus prov...
Ting Zhang, Henny B. Sipma, Zohar Manna
FMCAD
2009
Springer
13 years 9 months ago
Generalized, efficient array decision procedures
Abstract--The theory of arrays is ubiquitous in the context of software and hardware verification and symbolic analysis. The basic array theory was introduced by McCarthy and allow...
Leonardo Mendonça de Moura, Nikolaj Bj&osla...
TPLP
2008
89views more  TPLP 2008»
13 years 4 months ago
Theory of finite or infinite trees revisited
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 ...
Khalil Djelloul, Thi-Bich-Hanh Dao, Thom W. Fr&uum...