17 search results - page 2 / 4 » The ground axiom |
IJCAI
1997
13 years 7 months ago
1997
We propose a method of compiling circumscription into Extended Logic Programs which is widely applicable to a class of parallel circumscription as well as a class of prioritized c...
WRLA
2010
13 years 4 months ago
2010
For a rewrite theory to be executable, its equations E should be (ground) confluent and terminating modulo the given axioms A, and their rules should be (ground) coherent with E m...
CSL
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. Applications in software verification often require determining the satisfiability of first-order formulæ with respect to some background theories. During development...
FSEN
2007
Springer
13 years 9 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...
WEBI
2001
Springer
13 years 10 months ago
2001
Springer
In the proposed data model for XML databases, an XML element is directly represented as a ground (variable-free) XML expression—a generalization of an XML element by incorporatio...