On condensation of a clause

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 2835, Issue , 2003, Pages 164-179

  Hirata, Kouichi ^a  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; LEARNING ALGORITHMS; REDUNDANCY; SET THEORY; COMPUTER CIRCUITS; CONDENSATION; RECONFIGURABLE HARDWARE;

CONDENSATION OF A CLAUSE; OPTIMAL CONDENSATION; TOTAL MATCHER GRAPH; GREEDY ALGORITHMS;

INFORMATION THEORY; INDUCTIVE LOGIC PROGRAMMING (ILP);

EID: 9444249340     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-39917-9_12     Document Type: Conference Paper

References (20)

1. H. Arimura, Learning acyclic first-order Horn sentences from entailment, in: Proc. 8th International Workshop on Algorithmic Learning Theory, LNAI 1316, 432-445, 1997.
2. R. Boppana, M.M. Halldórsson, Approximating maximum independent sets by excluding subgraphs, BIT 32, 180-196, 1992.
3. L.D. Baxter, The complexity of unification, Doctoral Thesis, Department of Computer Science, University of Waterloo, 1977.
4. R. Carraghan, P. Pardalos, An exact algorithm for the maximum clique problem, Operations Research Letters 9, 375-382, 1990.
5. C.-L. Chang, R.C.-T. Lee, Symbolic logic and mechanical theorem proving, Academic Press, 1973.
6. C. Chekuri, A. Rajaraman, Conjunctive query containment revised, Theoretical Computer Science 239, 211-229, 2000.
7. M.R. Garey, D.S. Johnson, Computers and intractability: A guide to the theory of NP-completeness, W.H. Freeman and Company, 1979.
8. G. Gottlob, C.G. Fermüller, Removing redundancy from a clause, Artificial Intelligence 61, 263-289, 1993.
9. T. Horváth, R.H. Sloan, G. Turán, Learning logic programs by using the product homomorphism method, in: Proc. 10th Annual Workshop on Computational Learning Theory, 10-20, 1997.
10. T. Horváth, G. Turán, Learning logic programs with structured background knowledge, in L. de Raedt (ed.): Advances in inductive logic programming, IOS Press, 172-191, 1996.
11. W.H. Joyner, Resolution strategies as decision procedures, Journal of the ACM 23, 398-417, 1976.
12. A. Leitsch, The resolution calculus, Springer-Verlag, 1997.
13. J.W. Lloyd, Foundations of logic programming (2nd extended edition), Springer-Verlag, 1987.
14. J. Maloberti, M. Sebag, θ-subsumption in a constraint satisfaction perspective, in: Proc. 11th International Workshop on Inductive Logic Programming, LNAI 2157, 164-178, 2001.
15. S.-H. Nienhuys-Cheng, R. de Wolf, Foundations of inductive logic programming, LNAI 1228, 1997.
16. G.D. Plotkin, A note on inductive generalization, Machine Intelligence 5, 153-163, 1970.
17. C. Reddy, P. Tadepalli, Learning first-order acyclic Horn programs from entailment, in: Proc. 15th International Conference on Machine Learning, 472-480, 1998.
18. C. Reddy, P. Tadepalli, Learning Horn definitions: Theory and application to planning, New Generation Computing 17, 77-98, 1999.
19. T. Scheffer, R. Herbrich, F. Wysotzki, Efficient θ-subsumption based on graph algorithms, in: Proc. 6th International Workshop on Inductive Logic Programming, LNAI 1314, 212-228, 1996.
20. P.R.J. van der Laag, An analysis of refinement operators in inductive logic programming, Ph.D. Thesis, Tinbergen Institute, 1995.