The inverse satisfiability problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1090, Issue , 1996, Pages 250-259

  Kavvadias, Dimitris ^a   Sideri, Martha ^b  

^a UNIVERSITY OF PATRAS   (Greece)

^b ATHENS UNIVERSITY OF ECONOMICS AND BUSINESS   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; POLYNOMIAL APPROXIMATION;

BITVECTORS; BOOLEAN EXPRESSIONS; CONJUNCTIVE NORMAL FORMS; DICHOTOMY THEOREM; LITERALS; POLYNOMIAL-TIME; SATISFIABILITY PROBLEMS; TRUTH ASSIGNMENT;

INVERSE PROBLEMS;

EID: 84948979842     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61332-3_158     Document Type: Conference Paper

References (16)

1. [AFP] D. Angluin, M. Frazier, L. Pitt: Learning conjunctions of Horn clauses. Machine Learning 9(2-3) (1992) 147-164.
2. [CK] C. C. Chang, H. J. Keisler: Model Theory North Holland (1990).
3. [Co] S. A. Cook: The complexity of theorem-proving procedures. Third Annual ACM Symposium on Theory of Computing, (1971) 151-158.
4. [CH] N. Creignou and M. Hermann: Complexity of Generalized Satisfiability Counting Problems. Information and Computation. Yet to appear, as of 95. Nov.
5. [DP] R. Dechter and J. Pearl: Structure identification in relational data. Artificial Intelligence 58 (1993) 237-270.
6. [GN] M. R. Genesereth, N. J. Nilsson: Logical Foundations of Artificial Intelligence. Morgan Kauffmann Publishers (1987).
7. [GPS] G. Gogic, C. H. Papadimitriou, M. Sideri: Incremental recompilation of knowledge. National Conference on Artificial Intelligence (1994) 922-927.
8. [KKSl] H. A. Kautz, M. J. Kearns, B. Selman: Horn approximations of empirical data. Artificial Intelligence 74(1) (1995) 129-145.
9. [KKS2] H. A. Kautz, M. J. Kearns, B. Selman: Reasoning with characteristic models. National Conference on Artificial Intelligence (1993) 34-39.
10. [KPS] D. Kavvadias, C. H. Papadimitriou, M. Sideri: On Horn envelopes and hypergraph transversals. International Symposium on Algorithms and Complexity (1993) Hong Kong 399-405.
11. [Me] J. McCarthy: Círcumscription-a form of nonmonotonic reasoning. Artificial Intelligence 13 (1980) 27-39.
12. [Pa] C. H. Papadimitriou: Computational Complexity. Addison Wesley (1994).
13. [Re] R. Reiter: A Logic for default reasoning. Artificial Intelligence 13 (1980) 81-132.
14. [Sc] T. J. Schaefer: The complexity of satisfiability problems. Tenth Annual ACM Symposium on Theory of Computing (1978) 216-226.
15. [SKI] B. Selman, H. A. Kautz: Model preference default theories. Artificial Intelligence 45 (1990) 287-322.
16. [SK2] B. Selman, H. A. Kautz: Knowledge compilation using Horn approximation. National Conference on Artificial Intelligence (1991) 904-909.