메뉴 건너뛰기




Volumn 7, Issue , 2010, Pages 172-181

Subsumer: A prolog θsubsumption engine

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LOGIC; CONSTRAINT PROGRAMMING; IMPERATIVE LANGUAGES; INDEPENDENT COMPONENTS; LITERALS; LOGIC PROBLEMS; MEMORY REQUIREMENTS; RECURSIVE DECOMPOSITION;

EID: 84880247781     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.ICLP.2010.172     Document Type: Conference Paper
Times cited : (10)

References (13)
  • 3
    • 33749333633 scopus 로고    scopus 로고
    • The design and implementation of the YAP compiler: An optimizing compiler for logic programming languages
    • dS06, In Sandro Etalle and Miroslaw Truszczynski (eds.), LNCS, vol. 4079, Springer
    • [dS06] Anderson Faustino da Silva and Vítor Santos Costa. The design and implementation of the YAP compiler: An optimizing compiler for logic programming languages. In Sandro Etalle and Miroslaw Truszczynski (eds.), ICLP, LNCS, vol. 4079, pp. 461-462. Springer, 2006.
    • (2006) ICLP , pp. 461-462
    • Da Silva, A.F.1    Santos Costa, V.2
  • 4
    • 0034320732 scopus 로고    scopus 로고
    • Phase transitions in relational learning
    • Gio00
    • [Gio00] Attilio Giordana and Lorenza Saitta. Phase transitions in relational learning. Machine Learning, 41(2):217-251, 2000.
    • (2000) Machine Learning , vol.41 , Issue.2 , pp. 217-251
    • Giordana, A.1    Saitta, L.2
  • 5
    • 84957044441 scopus 로고
    • NP-completeness of the set unification and matching problems
    • Kap86, In Jörg H. Siekmann (ed.), LNCS, vol. 230, Springer
    • [Kap86] Deepak Kapur and Paliath Narendran. NP-completeness of the set unification and matching problems. In Jörg H. Siekmann (ed.), CADE, LNCS, vol. 230, pp. 489-495. Springer, 1986.
    • (1986) CADE , pp. 489-495
    • Kapur, D.1    Narendran, P.2
  • 6
    • 85152515906 scopus 로고
    • An efficient subsumption algorithm for inductive logic programming
    • Kie94, Morgan Kaufmann
    • [Kie94] Jrg-Uwe Kietz and Marcus Lbbe. An efficient subsumption algorithm for Inductive Logic Programming. Proc. 11th Int. Conf. on Machine Learning, pp. 130-138. Morgan Kaufmann, 1994.
    • (1994) Proc. 11th Int. Conf. on Machine Learning , pp. 130-138
    • Kietz, J.-U.1    Lbbe, M.2
  • 7
    • 0008267175 scopus 로고
    • Linear resolution with selection function
    • Kow71
    • [Kow71] Robert A. Kowalski and Donald Kuehner. Linear resolution with selection function. Artif. Intell., 2(3/4):227-260, 1971.
    • (1971) Artif. Intell. , vol.2 , Issue.3-4 , pp. 227-260
    • Kowalski, R.A.1    Kuehner, D.2
  • 8
    • 58149481650 scopus 로고    scopus 로고
    • A restarted strategy for efficient subsumption testing
    • Kuz08
    • [Kuz08] Ondrej Kuzelka and Filip Zelezný. A restarted strategy for e-cient subsumption testing. Fundam. Inform., 89(1):95-109, 2008.
    • (2008) Fundam. Inform. , vol.89 , Issue.1 , pp. 95-109
    • Kuzelka, O.1    Zelezný, F.2
  • 9
    • 22944441060 scopus 로고    scopus 로고
    • Fast theta-subsumption with constraint satisfaction algorithms
    • Mal04
    • [Mal04] Jér̂ome Maloberti and Michèle Sebag. Fast theta-subsumption with constraint satisfaction algorithms. Machine Learning, 55(2):137-174, 2004.
    • (2004) Machine Learning , vol.55 , Issue.2 , pp. 137-174
    • Maloberti, J.1    Sebag, M.2
  • 10
    • 77955020388 scopus 로고    scopus 로고
    • Progolem: A system based on relative minimal generalisation
    • Mug09, In Luc De Raedt (ed.), LNCS, vol. 5989, Springer
    • [Mug09] Stephen Muggleton, Jose Santos, and Alireza Tamaddoni-Nezhad. Progolem: a system based on relative minimal generalisation. In Luc De Raedt (ed.), Proceedings of the 19th International Conference on ILP, LNCS, vol. 5989, pp. 131-148. Springer, 2009.
    • (2009) Proceedings of the 19th International Conference on ILP , pp. 131-148
    • Muggleton, S.1    Santos, J.2    Tamaddoni-Nezhad, A.3
  • 11
    • 84918983692 scopus 로고
    • A machine-oriented logic based on the resolution principle
    • Rob65
    • [Rob65] John Alan Robinson. A machine-oriented logic based on the resolution principle. J. ACM, 12(1):23- 41, 1965.
    • (1965) J. ACM , vol.12 , Issue.1 , pp. 23-41
    • Robinson, J.A.1
  • 12
    • 77954396828 scopus 로고    scopus 로고
    • Efficient theta-subsumption based on graph algorithms
    • Sch96, In S. Muggleton (ed.), LNCS, vol. 1314, Springer
    • [Sch96] Tobias Scheffer, Ralf Herbrich, and Fritz Wysotzki. Efficient theta-subsumption based on graph algorithms. In S. Muggleton (ed.), ILP workshop, LNCS, vol. 1314, pp. 212-228. Springer, 1996.
    • (1996) ILP Workshop , pp. 212-228
    • Scheffer, T.1    Herbrich, R.2    Wysotzki, F.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.