메뉴 건너뛰기




Volumn 110, Issue , 2004, Pages 808-812

A tabulation proof procedure for residuated logic programming

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS; INTELLIGENT DATABASES; SEMANTICS;

EID: 85017404833     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Conference Paper
Times cited : (8)

References (25)
  • 1
    • 0036736416 scopus 로고    scopus 로고
    • Towards an automated deduction system for first-order possibilistic logic programming with fuzzy constants
    • T. Alsinet and L. Godo. Towards an automated deduction system for first-order possibilistic logic programming with fuzzy constants. International Journal of Intelligent Systems, 17(9), 2002.
    • (2002) International Journal of Intelligent Systems , vol.17 , Issue.9
    • Alsinet, T.1    Godo, L.2
  • 3
    • 0003238899 scopus 로고
    • The underlying search for magic templates and tabulation
    • R. Bol and L. Degerstedt. The underlying search for magic templates and tabulation. In Proc. of ICLP93, pages 793-811, 1993.
    • (1993) Proc. of ICLP93 , pp. 793-811
    • Bol, R.1    Degerstedt, L.2
  • 4
    • 0040398810 scopus 로고    scopus 로고
    • Annotated fuzzy logic programs
    • T. Cao. Annotated fuzzy logic programs. Fuzzy Sets and Systems, 113(2):277-298, 2000.
    • (2000) Fuzzy Sets and Systems , vol.113 , Issue.2 , pp. 277-298
    • Cao, T.1
  • 5
    • 0001425243 scopus 로고
    • Efficient top-down computation of queries under the well-founded semantics
    • W. Chen, T. Swift, and D. S. Warren. Efficient top-down computation of queries under the well-founded semantics. Journal of Logic Programming, 24(3):161-199, 1995.
    • (1995) Journal of Logic Programming , vol.24 , Issue.3 , pp. 161-199
    • Chen, W.1    Swift, T.2    Warren, D.S.3
  • 7
    • 22944470420 scopus 로고    scopus 로고
    • Hybrid probabilistic logic programs as residuated logic programs
    • C. V. Daḿasio and L. M. Pereira. Hybrid probabilistic logic programs as residuated logic programs. Studia Logica, 72(1):113-138, 2002.
    • (2002) Studia Logica , vol.72 , Issue.1 , pp. 113-138
    • Daḿasio, C.V.1    Pereira, L.M.2
  • 10
    • 1842842040 scopus 로고    scopus 로고
    • Fuzzy prolog: A new approach using soft constraints propagation
    • S. Guadarrama, S. Mũnoz, and C. Vaucheret. Fuzzy prolog: A new approach using soft constraints propagation. Fuzzy Sets and Systems 144(1):127-150, 2004.
    • (2004) Fuzzy Sets and Systems , vol.144 , Issue.1 , pp. 127-150
    • Guadarrama, S.1    Mũnoz, S.2    Vaucheret, C.3
  • 11
    • 1842860809 scopus 로고    scopus 로고
    • Automatic derivation of probabilistic inference rules
    • M. Jaeger. Automatic derivation of probabilistic inference rules. International Journal of Approximate Reasoning, 28(1):1-22, 2001.
    • (2001) International Journal of Approximate Reasoning , vol.28 , Issue.1 , pp. 1-22
    • Jaeger, M.1
  • 12
    • 44049120122 scopus 로고
    • Theory of generalized annotated logic programming and its applications
    • M. Kifer and V. S. Subrahmanian. Theory of generalized annotated logic programming and its applications. J. of Logic Programming, 12:335-367, 1992.
    • (1992) J. of Logic Programming , vol.12 , pp. 335-367
    • Kifer, M.1    Subrahmanian, V.S.2
  • 14
    • 84867830547 scopus 로고    scopus 로고
    • Fixpoint characterizations for many-valued disjunctive logic programs with probabilistic semantics In Logic Progr. And Non-Monotonic Reasoning
    • LNAI
    • T. Lukasiewicz. Fixpoint Characterizations for Many-valued Disjunctive Logic Programs with Probabilistic Semantics In Logic Progr. and Non-Monotonic Reasoning, LPNMR'01, LNAI 2173:336-350, 2001.
    • (2001) LPNMR'01 , vol.2173 , pp. 336-350
    • Lukasiewicz, T.1
  • 15
    • 0010842519 scopus 로고    scopus 로고
    • Probabilistic logic programming with conditional constraints
    • T. Lukasiewicz. Probabilistic logic programming with conditional constraints. ACM Trans. Comput. Logic, 2(3):289-339, 2001.
    • (2001) ACM Trans. Comput. Logic , vol.2 , Issue.3 , pp. 289-339
    • Lukasiewicz, T.1
  • 18
    • 85014924802 scopus 로고    scopus 로고
    • Best possible answer is computable for SLD-resolution
    • L. Pauĺik. Best possible answer is computable for SLD-resolution. Lecture Notes in Logic, 6:257-266, 1996.
    • (1996) Lecture Notes In, Logic , vol.6 , pp. 257-266
    • Pauĺik, L.1
  • 19
    • 0029358562 scopus 로고
    • Towards a fuzzy logic programming system: A clausal form fuzzy logic
    • P. Rhodes and S. Merad-Menani. Towards a fuzzy logic programming system: A clausal form fuzzy logic. Knowledge-Based Systems, 8(4):174-182, 1995.
    • (1995) Knowledge-Based Systems , vol.8 , Issue.4 , pp. 174-182
    • Rhodes, P.1    Merad-Menani, S.2
  • 20
    • 0037187409 scopus 로고    scopus 로고
    • Approximate reasoning by similarity-based SLD resolution
    • M. Sessa. Approximate reasoning by similarity-based SLD resolution. Theoretical Computer Science, 275(1-2):389-426, 2002.
    • (2002) Theoretical Computer Science , vol.275 , Issue.1-2 , pp. 389-426
    • Sessa, M.1
  • 22
    • 85034427623 scopus 로고
    • OLD resolution with tabulation
    • H. Tamaki and T. Sato. OLD resolution with tabulation. In Proc. of ICLP'86, pages 84-98, 1986.
    • (1986) Proc. of ICLP'86 , pp. 84-98
    • Tamaki, H.1    Sato, T.2
  • 23
    • 0022693287 scopus 로고
    • Quantitative deduction and its fixpoint, theory
    • M. H. van Emden. Quantitative deduction and its fixpoint theory. Journal of Logic Programming, 3(1):37-53, 1986.
    • (1986) Journal of Logic Programming , vol.3 , Issue.1 , pp. 37-53
    • Van Emden, M.H.1
  • 24
    • 0035900850 scopus 로고    scopus 로고
    • Fuzzy logic programming
    • P. Vojtǎs. Fuzzy logic programming. Fuzzy sets and systems, 124(3):361-370, 2001.
    • (2001) Fuzzy Sets and Systems , vol.124 , Issue.3 , pp. 361-370
    • Vojtǎs, P.1


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