Why horn formulas matter in computer science: Initial structures and generic examples
- 1 April 1987
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 34 (2-3) , 266-292
- https://doi.org/10.1016/0022-0000(87)90027-4
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- An Evaluation Based Theorem ProverPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1985
- Horn clauses and database dependenciesJournal of the ACM, 1982
- Office-by-Example: A business language that unifies data and word processing and electronic mailIBM Systems Journal, 1982
- Horn clause computabilityBIT Numerical Mathematics, 1977
- Unit Refutations and Horn SetsJournal of the ACM, 1974
- Polynomials with Rational Coefficients Which are Hard to ComputeSIAM Journal on Computing, 1974
- The decision problem for some classes of sentences without quantifiersThe Journal of Symbolic Logic, 1943