519 search results - page 30 / 104 » Qualitative choice logic |
FOSSACS
2005
Springer
14 years 1 months ago
2005
Springer
Modal logic has a good claim to being the logic of choice for describing the reactive behaviour of systems modeled as coalgebras. Logics with modal operators obtained from so-calle...
FUZZIEEE
2007
IEEE
14 years 2 months ago
2007
IEEE
— Possibilistic logic is essentially a formalism for handling qualitative uncertainty with an inference machinery that remains close to the one of classical logic. It is capable ...
TIME
2005
IEEE
14 years 1 months ago
2005
IEEE
We exploit the fact that qualitative Interval Algebra (IA) network problems are finite domain CSPs. In the first part of the paper, we show how to convert a qualitative IA network ...
CIE
2010
Springer
14 years 22 days ago
2010
Springer
We develop applications of selection functions to proof theory and computational extraction of witnesses from proofs in classical analysis. The main novelty is a translation of cla...
FMCAD
2008
Springer
13 years 9 months ago
2008
Springer
We present a general approach for verifying safety properties of Lustre programs automatically. Key aspects of the approach are the choice of an expressive first-order logic in wh...