Tractable Databases: How to Make Propositional Unit Resolution Complete through Compilation
Author:
- Alvaro del ValAVAlvaro del Val
- 1 January 1994
- book chapter
- Published by Elsevier
- p. 551-561
Abstract
No abstract availableThis publication has 9 references indexed in Scilit:
- Approximate entailmentLecture Notes in Computer Science, 1991
- An incremental method for generating prime implicants/implicatesJournal of Symbolic Computation, 1990
- Making believers out of computersArtificial Intelligence, 1986
- On the number of prime implicantsDiscrete Mathematics, 1978
- Unit Refutations and Horn SetsJournal of the ACM, 1974
- A note on linear resolution strategies in consequence-findingArtificial Intelligence, 1972
- Two Results on Ordering for Resolution with Merging and Linear FormatJournal of the ACM, 1971
- Resolution With MergingJournal of the ACM, 1968
- Generalization of Consensus Theory and Application to the Minimization of Boolean FunctionsIEEE Transactions on Electronic Computers, 1967