메뉴 건너뛰기




Volumn 31, Issue 6, 2005, Pages 608-647

Issues in parallel execution of non-monotonic reasoning systems

Author keywords

Answer set programming; Beowulf clusters; Logic programming; Non monotonic reasoning

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SOFTWARE; PARALLEL PROCESSING SYSTEMS; SET THEORY; SYSTEMS ENGINEERING;

EID: 21244475228     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2005.03.004     Document Type: Article
Times cited : (33)

References (63)
  • 1
    • 0024886764 scopus 로고
    • Fixpoint extensions of first-order logic and datalog-like languages
    • IEEE Computer Society Los Alamitos, CA
    • S. Abiteboul, and V. Vianu Fixpoint extensions of first-order logic and datalog-like languages Symposium on Logic in Computer Science 1989 IEEE Computer Society Los Alamitos, CA 71 89
    • (1989) Symposium on Logic in Computer Science , pp. 71-89
    • Abiteboul, S.1    Vianu, V.2
  • 4
    • 0028425519 scopus 로고
    • Logic programming and negation: A survey
    • K.R. Apt, and R.N. Bol Logic programming and negation: a survey Journal of Logic Programming 19/20 1994 9 71
    • (1994) Journal of Logic Programming , vol.19-20 , pp. 9-71
    • Apt, K.R.1    Bol, R.N.2
  • 5
    • 9444285966 scopus 로고    scopus 로고
    • Y. Babovich, CModels, < www.cs.utexas.edu/users/tag/cmodels.html >, 2002.
    • (2002) CModels
    • Babovich, Y.1
  • 7
    • 9444230698 scopus 로고    scopus 로고
    • Logic programs with consistency-restoring rules
    • AAAI/MIT Press Cambridge, MA
    • M. Balduccini, and M. Gelfond Logic programs with consistency-restoring rules AAAI Spring Symposium 2003 AAAI/MIT Press Cambridge, MA
    • (2003) AAAI Spring Symposium
    • Balduccini, M.1    Gelfond, M.2
  • 9
    • 19244381332 scopus 로고
    • Logic programming and knowledge representation
    • C. Baral, and M. Gelfond Logic programming and knowledge representation Journal of Logic Programming 19/20 1994 73 148
    • (1994) Journal of Logic Programming , vol.19-20 , pp. 73-148
    • Baral, C.1    Gelfond, M.2
  • 10
    • 0344674971 scopus 로고    scopus 로고
    • Reasoning agents in dynamic domains
    • University of Texas at El Paso
    • C. Baral, M. Gelfond, Reasoning agents in dynamic domains, Technical report, University of Texas at El Paso, 1999.
    • (1999) Technical Report
    • Baral, C.1    Gelfond, M.2
  • 12
    • 0036926274 scopus 로고    scopus 로고
    • Logic programming with ordered disjunction
    • AAAI/MIT Press Cambridge, MA
    • G. Brewka Logic programming with ordered disjunction AAAI/IAAA 2002 AAAI/MIT Press Cambridge, MA 100 105
    • (2002) AAAI/IAAA , pp. 100-105
    • Brewka, G.1
  • 13
    • 0030260263 scopus 로고    scopus 로고
    • Computation of stable models and its integration with logical query processing
    • W. Chen, and D.S. Warren Computation of stable models and its integration with logical query processing Transactions on Knowledge and Data Engineering 8 5 1996 742 757
    • (1996) Transactions on Knowledge and Data Engineering , vol.8 , Issue.5 , pp. 742-757
    • Chen, W.1    Warren, D.S.2
  • 15
    • 0000826543 scopus 로고
    • Negation as failure
    • H. Gallaire J. Minker Plenum New York
    • K.L. Clark Negation as failure H. Gallaire J. Minker Logic and Data Bases 1978 Plenum New York 293 322
    • (1978) Logic and Data Bases , pp. 293-322
    • Clark, K.L.1
  • 16
    • 0040337293 scopus 로고
    • A method for efficiently executing horn clause programs using multiple processors
    • W.F. Clocksin, and H. Alshawi A method for efficiently executing horn clause programs using multiple processors New Generation Computing 5 1988 361 376
    • (1988) New Generation Computing , vol.5 , pp. 361-376
    • Clocksin, W.F.1    Alshawi, H.2
  • 19
    • 0021509216 scopus 로고
    • Linear-time algorithms for testing the satisfiability of propositional horn formulae
    • W.F. Dowling, and J.H. Gallier Linear-time algorithms for testing the satisfiability of propositional horn formulae Journal of Logic Programming 3 1984 267 289
    • (1984) Journal of Logic Programming , vol.3 , pp. 267-289
    • Dowling, W.F.1    Gallier, J.H.2
  • 22
    • 0031359893 scopus 로고    scopus 로고
    • Abduction from logic programs: Semantics and complexity
    • T. Eiter, G. Gottlob, and N. Leone Abduction from logic programs: semantics and complexity Theoretical Computer Science 189 1-2 1997 129 177
    • (1997) Theoretical Computer Science , vol.189 , Issue.1-2 , pp. 129-177
    • Eiter, T.1    Gottlob, G.2    Leone, N.3
  • 26
    • 35248878751 scopus 로고    scopus 로고
    • Reconstructing the evolutionary history of Indo-European languages using answer set programming
    • Springer-Verlag Berlin
    • E. Erdem, V. Lifschitz, L. Nakhleh, and D. Ringe Reconstructing the evolutionary history of Indo-European languages using answer set programming Practical Aspects of Declarative Languages 2003 Springer-Verlag Berlin 160 176
    • (2003) Practical Aspects of Declarative Languages , pp. 160-176
    • Erdem, E.1    Lifschitz, V.2    Nakhleh, L.3    Ringe, D.4
  • 28
    • 84974728119 scopus 로고    scopus 로고
    • The USA-advisor: A case study in answer set programming
    • Springer-Verlag Berlin
    • M. Gelfond The USA-advisor: a case study in answer set programming Logics in Artificial Intelligence 2002 Springer-Verlag Berlin 566 568
    • (2002) Logics in Artificial Intelligence , pp. 566-568
    • Gelfond, M.1
  • 29
    • 77951505493 scopus 로고
    • Classical negation in logic programs and disjunctive databases
    • M. Gelfond, and V. Lifschitz Classical negation in logic programs and disjunctive databases New Generation Computing 1991 365 385
    • (1991) New Generation Computing , pp. 365-385
    • Gelfond, M.1    Lifschitz, V.2
  • 33
    • 0030645703 scopus 로고    scopus 로고
    • Optimization schemas for parallel implementation of nondeterministic languages and systems
    • IEEE Computer Society Los Alamitos, CA
    • G. Gupta, and E. Pontelli Optimization schemas for parallel implementation of nondeterministic languages and systems International Parallel Processing Symposium 1997 IEEE Computer Society Los Alamitos, CA 428 435
    • (1997) International Parallel Processing Symposium , pp. 428-435
    • Gupta, G.1    Pontelli, E.2
  • 37
    • 0344243483 scopus 로고    scopus 로고
    • Answer set programming and plan generation
    • V. Lifschitz Answer set programming and plan generation Artificial Intelligence 138 2002 39 54
    • (2002) Artificial Intelligence , vol.138 , pp. 39-54
    • Lifschitz, V.1
  • 40
    • 0036923682 scopus 로고    scopus 로고
    • ASSAT: Computing answer sets of logic programs by SAT solvers
    • AAAI/MIT Press Cambridge, MA
    • F. Lin, and Y. Zhao ASSAT: Computing answer sets of logic programs by SAT solvers AAAI/IAAA 2002 AAAI/MIT Press Cambridge, MA 112 117
    • (2002) AAAI/IAAA , pp. 112-117
    • Lin, F.1    Zhao, Y.2
  • 42
    • 0001775594 scopus 로고    scopus 로고
    • Stable models and an alternative logic programming paradigm
    • K.R. Apt V.W. Marek M. Truszcziński D.S. Warren Springer-Verlag Berlin
    • V.W. Marek, and M. Truszczyński Stable models and an alternative logic programming paradigm K.R. Apt V.W. Marek M. Truszcziński D.S. Warren The Logic Programming Paradigm 1999 Springer-Verlag Berlin
    • (1999) The Logic Programming Paradigm
    • Marek, V.W.1    Truszczyński, M.2
  • 46
    • 0027694533 scopus 로고
    • An overview of nonmonotonic reasoning and logic programming
    • J. Minker An overview of nonmonotonic reasoning and logic programming Journal of Logic Programming 17 2-4 1993 95 126
    • (1993) Journal of Logic Programming , vol.17 , Issue.2-4 , pp. 95-126
    • Minker, J.1
  • 47
    • 0031643987 scopus 로고    scopus 로고
    • A distributed arc-consistency algorithm
    • T. Nguyen, and Y. Deville A distributed arc-consistency algorithm Science of Computer Programming 30 1-2 1998 227 250
    • (1998) Science of Computer Programming , vol.30 , Issue.1-2 , pp. 227-250
    • Nguyen, T.1    Deville, Y.2
  • 48
    • 0033260715 scopus 로고    scopus 로고
    • Logic programs with stable model semantics as a constraint programming paradigm
    • I. Niemelä Logic programs with stable model semantics as a constraint programming paradigm Annals of Mathematics and Artificial Intelligence 25 3-4 1999 241 273
    • (1999) Annals of Mathematics and Artificial Intelligence , vol.25 , Issue.3-4 , pp. 241-273
    • Niemelä, I.1
  • 49
    • 0002241745 scopus 로고    scopus 로고
    • Smodels-An implementation of the stable model and well-founded semantics for normal LP
    • Springer-Verlag Berlin
    • I. Niemela, and P. Simons Smodels-An implementation of the stable model and well-founded semantics for normal LP Logic Programming and Non-monotonic Reasoning 1997 Springer-Verlag Berlin 421 430
    • (1997) Logic Programming and Non-monotonic Reasoning , pp. 421-430
    • Niemela, I.1    Simons, P.2
  • 51
    • 0002960526 scopus 로고    scopus 로고
    • Efficient backtracking in and-parallel implementations of non-deterministic languages
    • T. Lai IEEE Computer Society Los Alamitos, CA
    • E. Pontelli, and G. Gupta Efficient backtracking in and-parallel implementations of non-deterministic languages T. Lai Proceedings of the International Conference on Parallel Processing 1998 IEEE Computer Society Los Alamitos, CA 338 345
    • (1998) Proceedings of the International Conference on Parallel Processing , pp. 338-345
    • Pontelli, E.1    Gupta, G.2
  • 52
    • 21244501722 scopus 로고    scopus 로고
    • On the complexity of dependent and-parallelism in logic programming
    • New Mexico State University
    • E. Pontelli, D. Ranjan, On the complexity of dependent and-parallelism in logic programming, Technical report, New Mexico State University, 2002.
    • (2002) Technical Report
    • Pontelli, E.1    Ranjan, D.2
  • 56
    • 0025406463 scopus 로고
    • Stable models and non-determinism in logic programs with negation
    • ACM Press
    • D. Saccà, and C. Zaniolo Stable models and non-determinism in logic programs with negation Symposium on Principles of Database Systems 1990 ACM Press 205 217
    • (1990) Symposium on Principles of Database Systems , pp. 205-217
    • Saccà, D.1    Zaniolo, C.2
  • 58
    • 0013281804 scopus 로고    scopus 로고
    • Comparing trailing and copying for constraint programming
    • MIT Press Cambridge, MA
    • C. Schulte Comparing trailing and copying for constraint programming International Conference on Logic Programming 1999 MIT Press Cambridge, MA 275 289
    • (1999) International Conference on Logic Programming , pp. 275-289
    • Schulte, C.1
  • 62
    • 1642578601 scopus 로고    scopus 로고
    • Implementation of local grounding for logic programs with stable model semantics
    • Helsinki University of Technology
    • T. Syrjanen, Implementation of local grounding for logic programs with stable model semantics, Technical Report B-18, Helsinki University of Technology, 1998.
    • (1998) Technical Report , vol.B-18
    • Syrjanen, T.1
  • 63
    • 71149116148 scopus 로고
    • The well-founded semantics for general logic programs
    • A. Van Gelder, K.A. Ross, and J.S. Schlipf The well-founded semantics for general logic programs Journal of the ACM 38 3 1991 620 650
    • (1991) Journal of the ACM , vol.38 , Issue.3 , pp. 620-650
    • Van Gelder, A.1    Ross, K.A.2    Schlipf, J.S.3


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