메뉴 건너뛰기




Volumn 19, Issue 2, 2006, Pages 155-172

A backjumping technique for disjunctive logic programming

Author keywords

Backjumping; Experiments; Logic programming; Stable models

Indexed keywords

BOOLEAN FUNCTIONS; HEURISTIC METHODS; LEARNING SYSTEMS; NUMERICAL ANALYSIS; SEMANTICS;

EID: 33744930603     PISSN: 09217126     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (24)

References (38)
  • 1
    • 9444287624 scopus 로고    scopus 로고
    • Answer set programming with Clause Learning
    • J. Ward and J.S. Schlipf, Answer set programming with Clause Learning, in: LPNMR-7, LNCS, 2004, pp. 302-313.
    • (2004) LPNMR-7, LNCS , pp. 302-313
    • Ward, J.1    Schlipf, J.S.2
  • 3
    • 0002239899 scopus 로고    scopus 로고
    • Answer set planning
    • Las Cruces, New Mexico, USA, D.D. Schreye, ed., The MIT Press
    • V. Lifschitz, Answer set planning, in: ICLP'99, Las Cruces, New Mexico, USA, D.D. Schreye, ed., The MIT Press, 1999, pp. 23-37.
    • (1999) ICLP'99 , pp. 23-37
    • Lifschitz, V.1
  • 5
    • 84880670427 scopus 로고    scopus 로고
    • Improvements to the evaluation of quantified Boolean formulae
    • T. Dean, ed., Sweden
    • J. Rintanen, Improvements to the evaluation of quantified Boolean formulae, in: IJCAI 1999, T. Dean, ed., Sweden, 1999, pp. 1192-1197.
    • (1999) IJCAI 1999 , pp. 1192-1197
    • Rintanen, J.1
  • 6
    • 0029236521 scopus 로고
    • The complexity of logic-based abduction
    • T. Eiter and G. Gottlob, The complexity of logic-based abduction, JACM 42 (1995), 3-42.
    • (1995) JACM , vol.42 , pp. 3-42
    • Eiter, T.1    Gottlob, G.2
  • 12
    • 0242365718 scopus 로고    scopus 로고
    • Enhancing disjunctive logic programming systems by SAT checkers
    • C. Koch, N. Leone and G. Pfeifer, Enhancing Disjunctive Logic Programming systems by SAT checkers, Artificial Intelligence 15 (2003), 177-212.
    • (2003) Artificial Intelligence , vol.15 , pp. 177-212
    • Koch, C.1    Leone, N.2    Pfeifer, G.3
  • 13
    • 0001372340 scopus 로고
    • Hybrid algorithms for the constraint satisfaction problem
    • P. Prosser, Hybrid algorithms for the constraint satisfaction problem, Computational Intelligence 9 (1993), 268-299.
    • (1993) Computational Intelligence , vol.9 , pp. 268-299
    • Prosser, P.1
  • 14
    • 0036532232 scopus 로고    scopus 로고
    • Backjump-based backtracking for constraint satisfaction problems
    • R. Dechter and D. Frost, Backjump-based backtracking for constraint satisfaction problems, Artificial Intelligence 136 (2002), 147-188.
    • (2002) Artificial Intelligence , vol.136 , pp. 147-188
    • Dechter, R.1    Frost, D.2
  • 18
    • 77951505493 scopus 로고
    • Classical negation in logic programs and Disjunctive Databases
    • M. Gelfond and V. Lifschitz, Classical negation in logic programs and Disjunctive Databases, NGC 9 (1991), 365-385.
    • (1991) NGC , vol.9 , pp. 365-385
    • Gelfond, M.1    Lifschitz, V.2
  • 19
    • 0000810454 scopus 로고
    • Stable semantics for Disjunctive Programs
    • T.C. Przymusinski, Stable semantics for Disjunctive Programs, NGC 9 (1991), 401-424.
    • (1991) NGC , vol.9 , pp. 401-424
    • Przymusinski, T.C.1
  • 20
    • 0041910547 scopus 로고
    • The relationship between logic program semantics and non-monotonic reasoning
    • MIT Press
    • W. Marek and V. Subrahmanian, The relationship between logic program semantics and non-monotonic reasoning, in: ICLP'89, MIT Press, 1989, pp. 600-617.
    • (1989) ICLP'89 , pp. 600-617
    • Marek, W.1    Subrahmanian, V.2
  • 21
    • 0002875208 scopus 로고    scopus 로고
    • Disjunctive stable models: Unfounded sets, fixpoint semantics and computation
    • N. Leone, P. Rullo and F. Scarcello, Disjunctive Stable Models: Unfounded sets, fixpoint semantics and computation, Information and Computation 135 (1997), 69-112.
    • (1997) Information and Computation , vol.135 , pp. 69-112
    • Leone, N.1    Rullo, P.2    Scarcello, F.3
  • 22
    • 19244381332 scopus 로고
    • Logic programming and knowledge representation
    • C. Baral and M. Gelfond, Logic programming and knowledge representation, JLP 19/20 (1994), 73-148.
    • (1994) JLP , vol.19-20 , pp. 73-148
    • Baral, C.1    Gelfond, M.2
  • 23
    • 71149116148 scopus 로고
    • The well-founded semantics for general logic programs
    • A. Van Gelder, K. Ross and J. Schlipf, The well-founded semantics for general logic programs, JACM 38 (1991), 620-650.
    • (1991) JACM , vol.38 , pp. 620-650
    • Van Gelder, A.1    Ross, K.2    Schlipf, J.3
  • 24
    • 21844488890 scopus 로고
    • Propositional semantics for disjunctive logic programs
    • R. Ben-Eliyahu and R. Dechter, Propositional semantics for Disjunctive Logic Programs, AMAI 12 (1994), 53-87.
    • (1994) AMAI , vol.12 , pp. 53-87
    • Ben-Eliyahu, R.1    Dechter, R.2
  • 26
    • 0002103329 scopus 로고    scopus 로고
    • Efficient implementation of the well-founded and stable model semantics
    • Bonn, Germany, M.J. Maher, ed., MIT Press
    • I. Niemelä and P. Simons, Efficient implementation of the well-founded and stable model semantics, in: ICLP'96, Bonn, Germany, M.J. Maher, ed., MIT Press, 1996, pp. 289-303.
    • (1996) ICLP'96 , pp. 289-303
    • Niemelä, I.1    Simons, P.2
  • 28
    • 1642318129 scopus 로고    scopus 로고
    • Using database optimization techniques for nonmonotonic reasoning
    • Prolog Association of Japan
    • W. Faber, N. Leone, C. Mateis and G. Pfeifer, Using database optimization techniques for nonmonotonic reasoning, in: DDLP '99, Prolog Association of Japan, 1999, pp. 135-139.
    • (1999) DDLP '99 , pp. 135-139
    • Faber, W.1    Leone, N.2    Mateis, C.3    Pfeifer, G.4
  • 29
    • 84880876929 scopus 로고    scopus 로고
    • Experimenting with heuristics for answer set programming
    • Seattle, WA, USA
    • W. Faber, N. Leone and G. Pfeifer, Experimenting with heuristics for answer set programming, in: IJCAI 2001, Seattle, WA, USA, 2001, pp. 635-640.
    • (2001) IJCAI 2001 , pp. 635-640
    • Faber, W.1    Leone, N.2    Pfeifer, G.3
  • 30
    • 33744898995 scopus 로고    scopus 로고
    • Optimizing the computation of heuristics for answer set programming systems
    • LNCS 2173
    • W. Faber, N. Leone and G. Pfeifer, Optimizing the computation of heuristics for answer set programming systems, in: LPNMR'01, LNCS 2173.
    • LPNMR'01
    • Faber, W.1    Leone, N.2    Pfeifer, G.3
  • 31
    • 0013455808 scopus 로고    scopus 로고
    • Pushing goal derivation in DLP computations
    • LNCS 1730
    • W. Faber, N. Leone and G. Pfeifer, Pushing goal derivation in DLP computations, in: LPNMR'99, LNCS 1730.
    • LPNMR'99
    • Faber, W.1    Leone, N.2    Pfeifer, G.3
  • 32
    • 9444285961 scopus 로고    scopus 로고
    • Pruning operators for answer set programming systems
    • F. Calimeri, W. Faber, N. Leone and G. Pfeifer, Pruning operators for answer set programming systems, in: NMR '2002, 2002, pp. 200-209.
    • (2002) NMR '2002 , pp. 200-209
    • Calimeri, F.1    Faber, W.2    Leone, N.3    Pfeifer, G.4
  • 34
    • 84861449103 scopus 로고    scopus 로고
    • Superscalar processor verification using efficient reductions of the logic of equality with uninterpreted functions to prepositional logic
    • Bad Herrenalb, Germany, Proceedings, NY, USA
    • M.N. Velev and R.E. Bryant, Superscalar processor verification using efficient reductions of the logic of equality with uninterpreted functions to prepositional logic, in: Correct Hardware Design and Verification Methods, 10th IFIP WG 10.5 Advanced Research Working Conference, CHARME'99, Bad Herrenalb, Germany, Proceedings, NY, USA, 1999, pp. 37-53.
    • (1999) Correct Hardware Design and Verification Methods, 10th IFIP WG 10.5 Advanced Research Working Conference, CHARME'99 , pp. 37-53
    • Velev, M.N.1    Bryant, R.E.2
  • 36
    • 21844511738 scopus 로고
    • On the computational cost of disjunctive logic programming: Propositional case
    • T. Eiter and G. Gottlob, On the computational cost of disjunctive logic programming: Propositional case, AMAI 15 (1995), 289-323.
    • (1995) AMAI , vol.15 , pp. 289-323
    • Eiter, T.1    Gottlob, G.2
  • 37
    • 0000371032 scopus 로고    scopus 로고
    • Experimental analysis of the computational cost of evaluating quantified Boolean formulae
    • Italy
    • M. Cadoli, A. Giovanardi and M. Schaerf, Experimental analysis of the computational cost of evaluating quantified Boolean formulae, in: AI*IA 97, Italy, 1997, pp. 207-218.
    • (1997) AI*IA , vol.97 , pp. 207-218
    • Cadoli, M.1    Giovanardi, A.2    Schaerf, M.3
  • 38
    • 33646110406 scopus 로고    scopus 로고
    • The QSAT phase transition
    • I. Gent and T. Walsh, The QSAT phase transition, in: AAAI, 1999.
    • (1999) AAAI
    • Gent, I.1    Walsh, T.2


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