Sciweavers

2067 search results - page 134 / 414
» Logics of propositional control
Sort
View
TACAS
2010
Springer
178views Algorithms» more  TACAS 2010»
15 years 8 months ago
An Alternative to SAT-Based Approaches for Bit-Vectors
The theory BV of bit-vectors, i.e. fixed-size arrays of bits equipped with standard low-level machine instructions, is becoming very popular in formal verification. Standard solv...
Sébastien Bardin, Philippe Herrmann, Floria...
116
Voted
IPPS
2007
IEEE
15 years 8 months ago
A Markov Reward Model for Software Reliability
A compositional method for estimating software reliability of many threaded programs is developed. The method uses estimates of the reliability of individual modules and the proba...
YoungMin Kwon, Gul Agha
131
Voted
FOIKS
2008
Springer
15 years 3 months ago
Merging First-Order Knowledge Using Dilation Operators
The area of knowledge merging is concerned with merging conflicting information while preserving as much as possible. Most proposals in the literature work with knowledge bases exp...
Nikos Gorogiannis, Anthony Hunter
110
Voted
IJCAI
2001
15 years 3 months ago
Bidding Languages for Combinatorial Auctions
Combinatorial auctions provide a valuable mechanism for the allocation of goods in settings where buyer valuations exhibit complex structure with respect to substitutabilityand co...
Craig Boutilier, Holger H. Hoos
116
Voted
AAAI
2000
15 years 3 months ago
Computing Circumscriptive Databases by Integer Programming: Revisited
In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axiom...
Ken Satoh, Hidenori Okamoto