30 search results - page 2 / 6 » First-Order Conditional Logic Revisited |
95
Voted
IJCAI
2001
14 years 11 months ago
2001
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
72
Voted
GG
2004
Springer
15 years 2 months ago
2004
Springer
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
78
Voted
LFCS
2007
Springer
15 years 3 months ago
2007
Springer
Density elimination by substitutions is introduced as a uniform method for removing applications of the Takeuti-Titani density rule from proofs in firstorder hypersequent calculi....
113
Voted
LORI
2009
Springer
15 years 4 months ago
2009
Springer
Arrow’s Theorem is a central result in social choice theory. It states that, under certain natural conditions, it is impossible to aggregate the preferences of a finite set of i...
114
click to vote
PTS
2010
14 years 7 months ago
2010
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...