SCOPUS 정보 검색 플랫폼

Annals of Mathematics and Artificial Intelligence

Volumn 15, Issue 3-4, 1995, Pages 289-323

On the computational cost of disjunctive logic programming: Propositional case

(2) Eiter, Thomas a Gottlob, Georg a

a VIENNA UNIVERSITY OF TECHNOLOGY (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21844511738 PISSN: 10122443 EISSN: 15737470 Source Type: Journal
DOI: 10.1007/BF01536399 Document Type: Article

Times cited : (330)

References (67)

1
- 84936151536
- K. Apt and H. Blair, Arithmetic classification of perfect models of stratified programs, Proc. ICLP/SLP-5 (MIT Press, 1988) pp. 766–779.

2
- 0342890536
- Morgan Kaufman, Washington DC
- (1988) Towards a theory of declarative knowledge , pp. 89-148
- Apt, K.¹ Blair, H.² Walker, A.³

3
- 84936141204
- C. Baral, J. Lobo and J. Minker, Generalized disjunctive well-founded semantics for logic programs: Declarative semantics, Proc. ISMIS-4, 1990, pp. 465–473.

4
- 84936138720
- R. Ben-Eliyahu and R. Dechter, Propositional semantics for disjunctive logic programs, Proc. ICLP/SLP-7, 1992, pp. 813–827. Full paper in Ann. of Math. and Artificial Intelligence 12 (1994) 53–87.

5
- 0026116482
- General logic databases and programs: Default semantics and stratification
- (1991) Inf. and Comput. , vol.19 , pp. 15-54
- Bidoit, N.¹ Froidevaux, C.²

6
- 44949278824
- Negation by default and unstratifiable programs
- (1991) Theoretical Computer Science , vol.78 , pp. 85-112
- Bidoit, N.¹ Froidevaux, C.²

7
- 84936150085
- H. Blair and C. Cholak, The complexity of local stratification, Technical Report, School of Computer and Information Sciences, Syracuse University (1992). To appear in Fund. Informaticae.

8
- 84936102967
- H. Blair, W. Marek, A. Nerode, and J. Remmel (editors), Informal Proceedings of the Workshop on Structural Complexity and Recursion-Theoretic Methods in Logic Programming, Washington DC, November 1992 (Cornell University, Mathematical Sciences Institute).

9
- 84936125848
- The expressiveness of locally stratified programs, Technical Report 92-8, Mathematical Sciences Institute, Cornell University (1992)
- (1995) Ann. of Math. and Artificial Intelligence , vol.15 , pp. 209-229
- Blair, H.¹ Marek, W.² Schlipf, J.³

10
- 0000443472
- The complexity of model checking for circumscriptive formulae
- (1992) Inf. Processing Lett. , vol.44 , pp. 113-118
- Cadoli, M.¹

11
- 0010511511
- The complexity of closed world reasoning and circumscription
- (1994) J. Comp. and Syst. Sci. , vol.43 , pp. 165-211
- Cadoli, M.¹ Lenzerini, M.²

12
- 0027694154
- A survey of complexity results for non-monotonic logics
- (1993) J. Logic Programming , vol.17 , pp. 127-160
- Cadoli, M.¹ Schaerf, M.²

13
- 0027574737
- A possible worlds semantics for disjunctive databases
- (1993) IEEE Trans. Data and Knowledge Eng. , vol.5 , Issue.2 , pp. 282-292
- Chan, E.¹

14
- 0022045348
- Horn clause queries and generalizations
- (1985) J. Logic Programming , vol.2 , pp. 1-15
- Chandra, A.¹ Harel, D.²

15
- 9444258689
- On unique satisfiability and randomized reductions
- (1990) Bull. EATCS , vol.47 , pp. 151-159
- Chang, R.¹ Rohatgi, P.²

16
- 0025431923
- Generalized closed world assumption is Π2⁰-complete
- (1990) Inf. Processing Lett. , vol.34 , pp. 289-291
- Chomicki, J.¹ Subrahmanian, V.S.²

17
- 84936158085
- J. Dix and M. Müller, Abstract properties and computational complexity of semantics for disjunctive logic programs, in Blair et al. [8], pp. 15–28.

18
- 84936146837
- J. Dix and M. Müller, Implementing semantics of disjunctive logic programs using fringes and abstract properties, Proc. LPNMR-2 (MIT Press, 1993) pp. 43–59.

19
- 0010317071
- Reasoning with parsimonious and moderately grounded expansions
- (1992) Fund. Informaticae , vol.17 , Issue.1-2 , pp. 31-53
- Eiter, T.¹ Gottlob, G.²

20
- 84936139703
- T. Eiter and G. Gottlob, Complexity results for disjunctive logic programming and application to nonmonotonic logics, Proc. ILPS-10 (MIT Press, 1993) pp. 266–278.

21
- 0027608575
- Propositional circumscription and extended closed world reasoning are Π2^p-complete
- (1993) Theor. Comp. Sci. , vol.114 , Issue.2 , pp. 231-245
- Eiter, T.¹ Gottlob, G.²

22
- 84936104422
- J. Fernández and J. Minker, Semantics of disjunctive deductive databases, Proc. ICDT-4 (Springer, 1992) pp. 21–50.

23
- 0003603813
- Freeman, New York
- (1979) Computers and Intractability — A Guide to the Theory of NP-Completeness
- Garey, M.¹ Johnson, D.S.²

24
- 84936075051
- M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, Proc. ILPS-5 (MIT Press, 1988) pp. 1070–1080.

25
- 77951505493
- Classical negation in logic programs and disjunctive databases
- (1991) New Generation Comput. , vol.9 , pp. 365-385
- Gelfond, M.¹ Lifschitz, V.²

26
- 0022898677
- Negation as failure: careful closure procedure
- (1986) Artificial Intelligence , vol.30 , pp. 273-287
- Gelfond, M.¹ Przymusinska, H.²

27
- 84936158634
- M. Gelfond, H. Przymusinska, V. Lifschitz and M. Truszczyński, Disjunctive defaults, Proc. KR-2, 1991, pp. 230–237.

28
- 0024606761
- On the relationship between circumscription and negation as failure
- (1989) Artificial Intelligence , vol.38 , pp. 75-94
- Gelfond, M.¹ Przymusinska, H.² Przymusinski, T.³

29
- 0000898194
- Complexity results for nonmonotonic logics
- (1992) J. Logic Comput. , vol.2 , Issue.3 , pp. 397-425
- Gottlob, G.¹

30
- 84936128284
- D.S. Johnson, A catalog of complexity classes, in J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. A (Elsevier Science Publ., 1990) chap. 2.

31
- 0026154296
- Hard problems for simple default logics
- (1991) Artificial Intelligence , vol.49 , pp. 243-279
- Kautz, H.¹ Selman, B.²

32
- 84936155756
- V. Lifschitz, Computing circumscription, Proc. IJCAI-9, 1985, pp. 121–127.

33
- 84936079218
- V. Lifschitz and G. Schwarz, Extended logic programs as autoepistemic theories, Proc. LPNMR-2 (MIT Press, 1993) pp. 101–114.

34
- 0003771686
- MIT Press, Cambridge, MA
- (1992) Foundations of Disjunctive Logic Programming
- Lobo, J.¹ Minker, J.² Rajasekar, A.³

35
- 34249835716
- A theory of nonmonotonic rule systems II
- (1992) Ann. of Math. and Artificial Intelligence , vol.5 , pp. 229-264
- Marek, W.¹ Nerode, A.² Remmel, J.³

36
- 33745063814
- How complicated is the set of stable models of a recursive logic program?
- (1992) Ann. Pure and Appl. Logic , vol.56 , pp. 119
- Marek, W.¹ Nerode, A.² Remmel, J.³

37
- 84936102276
- W. Marek, A. Rajasekar and M. Truszczyński, Complexity of computing with extended propositional logic programs, in Blair et al. [8], pp. 93–102.

38
- 0000313114
- Autoepistemic logic
- (1991) J. ACM , vol.38 , Issue.3 , pp. 588-619
- Marek, W.¹ Truszczyński, M.²

39
- 84936092677
- W. Marek and M. Truszczyński, Computing intersection of autoepistemic expansions, in Nerode et al. [46], pp. 37–50.

40
- 84936152952
- W. Marek and M. Truszczyński, Reflexive autoepistemic logic and logic programming, Proc. LPNMR-2 (MIT Press, 1993) pp. 115–131.

41
- 37349044608
- Circumscription — a form of non-monotonic reasoning
- (1980) Artificial Intelligence , vol.13 , pp. 27-39
- McCarthy, J.¹

42
- 0022661717
- Applications of circumscription to formalizing common-sense knowledge
- (1986) Artificial Intelligence , vol.28 , pp. 89-116
- McCarthy, J.¹

43
- 84936079962
- J. Minker, On indefinite data bases and the closed world assumption, Proc. CADE-6, 1982, pp. 292–308.

44
- 0009342765
- J., Minker, Morgan Kaufman, Washington DC
- (1988) Foundations of Deductive Databases and Logic Programming
- Minker, J.¹

45
- 0021819131
- Semantical considerations on nonmonotonic logics
- (1985) Artificial Intelligence , vol.25 , pp. 75-94
- Moore, R.¹

46
- 84936103125
- A. Nerode, W. Marek and V.S. Subrahmanian (editors), Proc. LPNMR-1 (MIT Press, 1991).

47
- 84936150790
- I. Niemelä, Towards automatic reasoning, Proc. Europ. Workshop on Logics in AI, Amsterdam, September 1990, LNCS # 478 (Springer, 1991).

48
- 0001599027
- Morgan Kaufman, Washington DC
- (1988) On the declarative and procedural semantics of stratified deductive databases , pp. 193-216
- Przymusinski, T.¹

49
- 0000810454
- Stable semantics for disjunctive programs
- (1991) New Generation Comput. , vol.9 , pp. 401-424
- Przymusinski, T.¹

50
- 0026156912
- Three-valued nonmonotonic formalisms and semantics of logic programming
- (1991) Artificial Intelligence , vol.49 , pp. 309-344
- Przymusinski, T.¹

51
- 0024734080
- Weak generalized closed world assumption
- (1989) J. Autom. Reasoning , vol.5 , pp. 293-307
- Rajasekar, A.¹ Lobo, J.² Minker, J.³

52
- 0002726244
- On closed-world databases
- H., Gallaire, J., Minker, Plenum Press, New York
- (1978) Logic and Data Bases , pp. 55-76
- Reiter, R.¹

53
- 49149147322
- A logic for default reasoning
- (1980) Artificial Intelligence , vol.13 , pp. 81-132
- Reiter, R.¹

54
- 84936081216
- K. Ross, The well-founded semantics for disjunctive logic programs, Proc. DOOD-1, 1989, pp. 352–369.

55
- 0024143038
- Inferring negative information from disjunctive databases
- (1988) J. Autom. Reasoning , vol.4 , Issue.2 , pp. 397-424
- Ross, K.¹ Topor, R.²

56
- 84936100760
- Ch. Sakama, Possible model semantics for disjunctive databases, Proc. DOOD-1, 1989, pp. 337–351.

57
- 84936081770
- Schaerf, M.¹

58
- 84936154375
- J.S. Schlipf, The expressive powers of logic programming semantics, Technical Report CIS-TR-90-3, Computer Science Department, University of Cincinnati (1990). Preliminary version in Proc. PODS-90, pp. 196–204. To appear in J. Comp. and Syst. Sci.

59
- 84936105214
- J.S. Schlipf, A survey of complexity and undecidability results in logic programming, in Blair et al. [8], pp. 93–102.

60
- 84936076353
- J.S. Schlipf., When is closed world reasoning tractable?, Proc. ISMIS-3 (Elsevier Science Publ., 1998) pp. 485–494.

61
- 84936089548
- G. Schwarz, Autoepistemic logic of knowledge, in Nerode et al. [46], pp. 260–274.

62
- 84936090811
- J. Stillman, The complexity of propositional default logic, Proc. AAAI-10, 1992, pp. 794–799.

63
- 84936150865
- L. Stockmeyer and A. Meyer, Word problems requiring exponential time, Proc. STOC-5 (ACM, 1973) pp. 1–9.

64
- 0009134962
- Morgan Kaufman, Washington DC
- (1988) Negation as failure using tight derivations for general logic programs , pp. 1149-1176
- Van Gelder, A.¹

65
- 71149116148
- The well-founded semantics for general logic programs
- (1991) J. ACM , vol.38 , Issue.3 , pp. 620-650
- Van Gelder, A.¹ Ross, K.² Schlipf, J.S.³

66
- 0025507099
- Bounded query classes
- (1990) SIAM J. Comp. , vol.19 , Issue.5 , pp. 833-846
- Wagner, K.¹

67
- 0000372137
- Deduction in non-Horn databases
- (1985) J. Autom. Reasoning , vol.1 , Issue.2 , pp. 141-160
- Yahya, A.¹ Henschen, L.²

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