31 search results - page 4 / 7 » Structured anaphora to quantifier domains |
CP
2008
Springer
13 years 8 months ago
2008
Springer
This paper presents a global constraint that enforces rules written in a language based on arithmetic and first-order logic to hold among a set of objects. In a first step, the rul...
ATAL
2004
Springer
13 years 11 months ago
2004
Springer
Decision-theoretic models have become increasingly popular as a basis for solving agent and multiagent problems, due to their ability to quantify the complex uncertainty and prefe...
BIRTHDAY
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
EDCC
2008
Springer
13 years 8 months ago
2008
Springer
In avionics domain, the software applications grew to millions of source lines of code representing important development expenditures. To cut the costs, the avionics suppliers ar...
CADE
2005
Springer
14 years 6 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...