메뉴 건너뛰기




Volumn , Issue , 2001, Pages

Experiments in parallel execution of answer set programs

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; COMPUTER PROGRAMMING LANGUAGES; CONSTRAINT THEORY; INTELLIGENT AGENTS; LOGIC PROGRAMMING;

EID: 84981263634     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2001.924954     Document Type: Conference Paper
Times cited : (4)

References (16)
  • 3
    • 19244381332 scopus 로고
    • Logic Programming and Knowledge Representation
    • C. Baral and M. Gelfond. Logic Programming and Knowledge Representation. Journal of Logic Programming, 19/20:73-148, 1994.
    • (1994) Journal of Logic Programming , vol.19-20 , pp. 73-148
    • Baral, C.1    Gelfond, M.2
  • 4
    • 0009427786 scopus 로고
    • Implementing Stable Semantics by Linear Programming
    • MIT Press
    • C. Bell et al. Implementing Stable Semantics by Linear Programming. Logic Progr. and Non-mon. Reasoning, MIT Press, 1993.
    • (1993) Logic Progr. and Non-mon. Reasoning
    • Bell, C.1
  • 5
    • 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. IEEE TKDE, 8(5), 1996.
    • (1996) IEEE TKDE , vol.8 , Issue.5
    • Chen, W.1    Warren, D.S.2
  • 7
    • 0040337293 scopus 로고
    • A Method for Efficiently Executing Horn Programs Using Multiple Processors
    • W.F. Clocksin et al. A Method for Efficiently Executing Horn Programs Using Multiple Processors. New Gen. Computing, 1988.
    • (1988) New Gen. Computing
    • Clocksin, W.F.1
  • 8
    • 0021509216 scopus 로고
    • Linear-time Algorithms for Testing Satisfiability of Horn Formulae
    • W.F. Dowling et al. Linear-time Algorithms for Testing Satisfiability of Horn Formulae. J. Logic Programming, 3:267-289, 1984.
    • (1984) J. Logic Programming , vol.3 , pp. 267-289
    • Dowling, W.F.1
  • 12
    • 27344438911 scopus 로고    scopus 로고
    • Stable Models as an Alternative Programming Paradigm
    • Springer
    • V.W. Marek and M. Truszczynski. Stable Models as an Alternative Programming Paradigm. Logic Progr. Paradigm. Springer, 1999.
    • (1999) Logic Progr. Paradigm.
    • Marek, V.W.1    Truszczynski, M.2
  • 13
    • 84981196586 scopus 로고    scopus 로고
    • Logic Programs with Stable Model Semantics as a Constraint Paradigm
    • I. Niemela. Logic Programs with Stable Model Semantics as a Constraint Paradigm. Annals of Math. and AI, (to appear).
    • Annals of Math. and AI
    • Niemela, I.1
  • 14
    • 0002241745 scopus 로고    scopus 로고
    • Smodels - An Implementation of the Stable Model and Well-Founded Semantics
    • Springer
    • I. Niemela and P. Simons. Smodels - An Implementation of the Stable Model and Well-Founded Semantics. LPNMR, Springer, 1997.
    • (1997) LPNMR
    • Niemela, I.1    Simons, P.2
  • 15
    • 0013281804 scopus 로고    scopus 로고
    • Compairing Trailing and Copying for Constraint Programming
    • MIT Press
    • C. Schulte. Compairing Trailing and Copying for Constraint Programming. Int. Conf. on Logic Progr., MIT Press, 1999.
    • (1999) Int. Conf. on Logic Progr.
    • Schulte, C.1
  • 16
    • 0003683967 scopus 로고
    • Parallel Constraint Satisfaction in Logic Programming
    • MIT Press
    • P. Van Hentenryck. Parallel Constraint Satisfaction in Logic Programming. Int. Conf. on Logic Progr. MIT Press, 1989.
    • (1989) Int. Conf. on Logic Progr.
    • Van Hentenryck, P.1


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