497 search results - page 4 / 100 » On combinations of local theory extensions |
86
Voted
AAAI
2006
15 years 1 months ago
2006
Some search problems are most directly specified by boolean combinations of pseudo-boolean constraints. We study a logic PL(PB) whose formulas are of this form, and design local-s...
73
Voted
LPAR
2010
Springer
14 years 10 months ago
2010
Springer
The classic method of Nelson and Oppen for combining decision procedures requires the theories to be stably-infinite. Unfortunately, some important theories do not fall into this...
99
Voted
FROCOS
2007
Springer
15 years 5 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...
LICS
2000
IEEE
15 years 4 months ago
2000
IEEE
Concurrent ML is an extension of Standard ML with π-calculus-like primitives for multi-threaded programming. CML has a reduction semantics, but to date there has been no labelled...
98
Voted
CORR
2006
Springer
14 years 11 months ago
2006
Springer
Abstract. We address the general problem of determining the validity of boolean combinations of equalities and inequalities between real-valued expressions. In particular, we consi...