Sciweavers

80 search results - page 8 / 16
» A Decision Procedure for Equality Logic with Uninterpreted F...
Sort
View
SLOGICA
2008
99views more  SLOGICA 2008»
13 years 5 months ago
Decidable Cases of First-order Temporal Logic with Functions
We consider the decision problem for cases of first-order temporal logic with function symbols and without equality. The monadic monodic fragment with flexible functions can be dec...
Walter Hussak
ENTCS
2008
89views more  ENTCS 2008»
13 years 7 months ago
CC(X): Semantic Combination of Congruence Closure with Solvable Theories
We present a generic congruence closure algorithm for deciding ground formulas in the combination of the theory of equality with uninterpreted symbols and an arbitrary built-in so...
Sylvain Conchon, Evelyne Contejean, Johannes Kanig...
EUSFLAT
2009
135views Fuzzy Logic» more  EUSFLAT 2009»
13 years 5 months ago
Exchanging Iterated Expectations of Random Upper Semicontinuous Functions: an application to decision theory
In this paper we present a procedure to deal with a kind of single-stage decision problems with imprecise utilities. In this type of problems the product measurability of the utili...
Miguel López-Díaz, Luis J. Rodr&iacu...
TPHOL
2009
IEEE
14 years 2 months ago
Extended First-Order Logic
ion and equality to base types but retains lambda abstractions and higher-order variables. We show that this fragment enjoys the characteristic properties of first-order logic: co...
Chad E. Brown, Gert Smolka
FMCAD
2006
Springer
13 years 11 months ago
Finite Instantiations for Integer Difference Logic
The last few years have seen the advent of a new breed of decision procedures for various fragments of first-order logic based on ional abstraction. A lazy satisfiability checker ...
Hyondeuk Kim, Fabio Somenzi