16 search results - page 2 / 4 » First-Order Axioms for Asynchrony |
FSEN
2007
Springer
15 years 1 months ago
2007
Springer
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulae. Test cases are modeled as ground formulae and any spe...
CORR
2008
Springer
14 years 8 months ago
2008
Springer
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
ISMVL
2007
IEEE
15 years 3 months ago
2007
IEEE
Paraconsistent logic is the study of contradictory yet non-trivial theories. One of the best-known approaches to designing useful paraconsistent logics is da Costa’s approach, w...
IJCAI
2001
14 years 10 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...
84
Voted
AAAI
1994
14 years 10 months ago
1994
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...