Learn More
There is a relatively large number of papers dealing with complexity and proof theory issues of infinitely-valued logics. Nevertheless, little attention has been paid so far to the development of efficient solvers for such logics. In this paper we show how the technology of Satisfiability Mod-ulo Theories (SMT) can be used to build efficient automated(More)
The Resource-Constrained Project Scheduling Problem (RCPSP) and some of its extensions have been widely studied. Many approaches have been considered to solve this problem: constraint programming (CP), Boolean satisfiabil-ity (SAT), mixed integer linear programming (MILP), branch and bound algorithms (BB) and others. In this paper, we present a new approach(More)
All current completeness results for ordered paramod-ulation require the term ordering to be well-founded, monotonic and total(izable) on ground terms. Here we introduce a new proof technique where the only properties required for are well-foundedness and the subterm property 1. The technique is a relatively simple and elegant application of some(More)
The Multi-Mode Resource-Constrained Project Scheduling Problem (MRCPSP) is a generalization of the well known Resource-Constrained Project Scheduling Problem (RCPSP). The most common exact approaches for solving this problem are based on branch-and-bound algorithms, mixed integer linear programming and Boolean satisfiability (SAT). In this paper, we present(More)
—The extensional theory of arrays is one of the most important ones for applications of SAT Modulo Theories (SMT) to hardware and software verification. Here we present a new T-solver for arrays in the context of the DPLL(T) approach to SMT. The main characteristics of our solver are: (i) no translation of writes into reads is needed, (ii) there is no axiom(More)
SAT Modulo Theories (SMT) consists of deciding the sat-isfiability of a formula with respect to a decidable background theory, such as linear integer arithmetic, bit-vectors, etc, in first-order logic with equality. SMT has its roots in the field of verification. It is known that the SAT technology offers an interesting, efficient and scalable method for(More)
In this paper we introduce Simply, a compiler from a declarative language for CSP modeling to the standard SMT-LIB format. The current version of Simply is able to generate problem instances falling into the quantifier free linear integer arithmetic logic. The compiler has been developed with the aim of building a system for easy CSP model-ing and solving.(More)
Up to now, all existing completeness results for ordered paramodulation and Knuth-Bendix completion require the term ordering to be well-founded, monotonic and total(izable) on ground terms. For several applications, these requirements are too strong, and hence weakening them has been a well-known research challenge. Here we introduce a new completeness(More)