43 search results - page 2 / 9 » Yet Another Decision Procedure for Equality Logic |
CADE
1998
Springer
13 years 9 months ago
1998
Springer
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...
ENTCS
2007
13 years 4 months ago
2007
The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an i...
CADE
2004
Springer
14 years 5 months ago
2004
Springer
We show how well-known refinements of ordered resolution, in particular redundancy elimination and ordering constraints in combination with a selection function, can be used to obt...
ICDT
2003
ACM
13 years 10 months ago
2003
ACM
We define a boolean complete description logic dialect called DLFDreg that can be used to reason about structural equality in semistructured ordered data in the presence of docume...
LPAR
2004
Springer
13 years 10 months ago
2004
Springer
Resolution-based calculi are among the most widely used calculi for theorem proving in first-order logic. Numerous refinements of resolution are nowadays available, such as e.g. ...