Skip to main content
Conference Proceedings

Simplification rules for constrained formula tableaux

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2003) 2796 65-80
DOI: 10.1007/978-3-540-45206-5_8
7Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Several variants of a first-order simplification rule for nonnormal form tableaux using syntactic constraints are presented. These can be used as a framework for porting methods like unit resolution or hyper tableaux to non-normal form free variable tableaux.

Cite

CITATION STYLE

APA

Giese, M. (2003). Simplification rules for constrained formula tableaux. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2796, pp. 65–80). Springer Verlag. https://doi.org/10.1007/978-3-540-45206-5_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free