Sciweavers

136 search results - page 3 / 28
» Extending the Resolution Method with Sorts
Sort
View
JELIA
2004
Springer
13 years 11 months ago
Combining Decision Procedures for Sorted Theories
The Nelson-Oppen combination method combines decision procedures for theories satisfying certain conditions into a decision procedure for their union. While the method is known to ...
Cesare Tinelli, Calogero G. Zarba
IFIPTCS
2010
13 years 3 months ago
Polarized Resolution Modulo
We present a restriction of Resolution modulo where the rewrite rules are such that clauses rewrite to clauses, so that the reduct of a clause needs not be further transformed into...
Gilles Dowek
EACL
1989
ACL Anthology
13 years 7 months ago
Expressing generalizations in unification-based grammar formalisms
This paper shows how higher levels of generalization can be introduced into unification grammars by exploiting methods for typing grammatical objects. We discuss the strategy of u...
Marc Moens, Jonathan Calder, Ewan Klein, Mike Reap...
WRLA
2010
13 years 4 months ago
A Maude Coherence Checker Tool for Conditional Order-Sorted Rewrite Theories
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...
Francisco Durán, José Meseguer
IQIS
2004
ACM
13 years 11 months ago
Utility-based Resolution of Data Inconsistencies
A virtual database system is software that provides unified access to multiple information sources. If the sources are overlapping in their contents and independently maintained,...
Amihai Motro, Philipp Anokhin, Aybar C. Acar