More on tractable disjunctive Datalog

Sometimes it is more natural to express knowledge in disjunctive Datalog rather than in ordinary Datalog. Several highly complex variants of disjunctive Datalog have been proposed in the past and their expressive power has been studied. In this paper we investigate tractable fragments of disjunctive...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	The journal of logic programming Ročník 46; číslo 1; s. 61 - 101
Hlavní autoři:	Ben-Eliyahu-Zohary, Rachel, Palopoli, Luigi, Zemlyanker, Victoria
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Inc 01.11.2000
Témata:	Disjunctive logic programming Expressive power of query languages Head-cycle-free programs Non-deterministic semantics Polynomial-time queries Head-cycle-free programs Disjunctive logic programming Polynomial-time queries Expressive power of query languages Non-deterministic semantics
ISSN:	0743-1066, 1873-5789
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	Sometimes it is more natural to express knowledge in disjunctive Datalog rather than in ordinary Datalog. Several highly complex variants of disjunctive Datalog have been proposed in the past and their expressive power has been studied. In this paper we investigate tractable fragments of disjunctive Datalog. Algorithms are presented to answer queries defined using these fragments and their complexity analyzed. Furthermore, the expressive power of these tractable subsets is studied. The most expressive of the languages considered here is shown to express, in some sense explained in the paper, all polynomial time queries. This is the first identified fragment of disjunctive Datalog with this property.
AbstractList	Sometimes it is more natural to express knowledge in disjunctive Datalog rather than in ordinary Datalog. Several highly complex variants of disjunctive Datalog have been proposed in the past and their expressive power has been studied. In this paper we investigate tractable fragments of disjunctive Datalog. Algorithms are presented to answer queries defined using these fragments and their complexity analyzed. Furthermore, the expressive power of these tractable subsets is studied. The most expressive of the languages considered here is shown to express, in some sense explained in the paper, all polynomial time queries. This is the first identified fragment of disjunctive Datalog with this property. Sometimes it is more natural to express knowledge in disjunctive Datalog rather than in ordinary Datalog. Several highly complex variants of disjunctive Datalog have been proposed in the past and their expressive power has been studied. In this paper we investigate tractable fragments of disjunctive Datalog. Algorithms are presented to answer queries defined using these fragments and their complexity analyzed. Furthermore, the expressive power of these tractable subsets is studied. The most expressive of the languages considered here is shown to express, in some sense explained in the paper, all polynomial time queries. This is the first identified fragment of disjunctive Datalog with this property.
Author	Zemlyanker, Victoria Ben-Eliyahu-Zohary, Rachel Palopoli, Luigi
Author_xml	– sequence: 1 givenname: Rachel surname: Ben-Eliyahu-Zohary fullname: Ben-Eliyahu-Zohary, Rachel email: rachel@cs.bgu.ac.il organization: Communication Systems Engineering Department, Ben Gurion University of the Negev, Ber-Sheeva 84105, Israel – sequence: 2 givenname: Luigi surname: Palopoli fullname: Palopoli, Luigi email: palopoli@si.deis.unical.it organization: Dip. di Elettr. Inform e Sist. (DEIS), Universita della Calabria, Arcavata di Rende, 87036 Rende (CS), Italy – sequence: 3 givenname: Victoria surname: Zemlyanker fullname: Zemlyanker, Victoria email: victoria@ie.technion.ac.il organization: Department of Information Engineering, Technion – Israel Institute of Technology, Haifa 32000, Israel
BookMark	eNqFkEtLAzEUhYNUsK3-BGE2ii5Gk8zkhQsp9QkVF-o6ZDJ3JGU6qUla8N87bcWFm67uXXzfgXNGaND5DhA6JfiKYMKv37Aoi5xgzi-UusS4f3JxgIZEiiJnQqoBGv4hR2gU47yHCCFsiM5efIDMd1kKxiZTtZDVLs5XnU1uDdmdSab1n8fosDFthJPfO0YfD_fv06d89vr4PJ3MclsUMuXAa06tURVvRC1ppQBYZSlVDZUSSgMESm4UazCrCRVAuCp5IRgrLYOaQjFG57vcZfBfK4hJL1y00LamA7-KmgqOJWWsB292oA0-xgCNti6Z5HzX93CtJlhvptHbafSmt1ZKb6fRorfZP3sZ3MKE773e7c6DfoO1g6CjddBZqF0Am3Tt3Z6EH9urfH4
CitedBy_id	crossref_primary_10_1016_j_artint_2016_03_006 crossref_primary_10_1109_TKDE_2003_1161596
Cites_doi	10.1016/S0304-3975(97)00129-1 10.1016/0022-0000(80)90032-X 10.1016/0890-5401(91)90059-B 10.1145/116825.116838 10.1109/CCC.1997.612304 10.1006/jcss.1995.1053 10.1145/800070.802186 10.1145/298514.298575 10.1137/0216051 10.1007/BF03037171 10.1016/0022-0000(93)90024-Q 10.1016/0022-0000(82)90012-5 10.1007/BFb0000066 10.1007/BF03037169 10.1007/BF01530761 10.1145/261124.261126 10.1007/3-540-57530-8_13 10.1145/298514.298589 10.1137/0201010 10.1007/BF01536399 10.1016/S0022-0000(05)80004-2 10.1016/S0019-9958(86)80029-8 10.1016/S0004-3702(97)00060-X 10.1007/3-540-55015-1_7 10.1016/0743-1066(85)90002-0
ContentType	Journal Article
Copyright	2000 Elsevier Science Inc.
Copyright_xml	– notice: 2000 Elsevier Science Inc.
DBID	6I. AAFTH AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D
DOI	10.1016/S0743-1066(99)00066-7
DatabaseName	ScienceDirect Open Access Titles Elsevier:ScienceDirect:Open Access CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts
DeliveryMethod	fulltext_linktorsrc
Discipline	Computer Science
EISSN	1873-5789
EndPage	101
ExternalDocumentID	10_1016_S0743_1066_99_00066_7 S0743106699000667
GroupedDBID	--K --M -~X .~1 0R~ 0SF 123 1B1 1RT 1~. 1~5 29K 4.4 4G. 5VS 6I. 7-5 71M 8P~ AACTN AAEDT AAEDW AAFTH AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABMAC ABVKL ABXDB ABYKQ ACDAQ ACGFS ACNCT ACNNM ACRLP ADBBV ADEZE ADMUD AEKER AETEA AEXQZ AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ ASPBG AVWKF AXJTR AZFZN BKOJK BLXMC CS3 D-I D0L EBS EFJIC EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBOLZ HVGLF HZ~ IHE IXB KOM KQ8 LG9 M26 M41 MO0 NCXOZ O-L O9- OAUVE OK1 OZT P-9 PC. Q38 R2- ROL RPZ SDF SDG SEW SPC SSV SSZ T5K TN5 UHS WUQ XJT 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABJNI ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU CITATION EFKBS ~HD 7SC 8FD JQ2 L7M L~C L~D
ID	FETCH-LOGICAL-c338t-e6d62ca9b6f7d82b9ee5bc229f288e4ae1e46a95f05d127e1694637554c5ed2e3
ISICitedReferencesCount	5
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000089821000002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0743-1066
IngestDate	Sat Sep 27 22:04:23 EDT 2025 Tue Nov 18 21:50:26 EST 2025 Sat Nov 29 06:24:12 EST 2025 Fri Feb 23 02:34:25 EST 2024
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	false
IsScholarly	false
Issue	1
Keywords	Head-cycle-free programs Disjunctive logic programming Polynomial-time queries Expressive power of query languages Non-deterministic semantics
Language	English
License	http://www.elsevier.com/open-access/userlicense/1.0 https://www.elsevier.com/tdm/userlicense/1.0 https://www.elsevier.com/open-access/userlicense/1.0
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c338t-e6d62ca9b6f7d82b9ee5bc229f288e4ae1e46a95f05d127e1694637554c5ed2e3
Notes	ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23
OpenAccessLink	https://dx.doi.org/10.1016/S0743-1066(99)00066-7
PQID	27608255
PQPubID	23500
PageCount	41
ParticipantIDs	proquest_miscellaneous_27608255 crossref_citationtrail_10_1016_S0743_1066_99_00066_7 crossref_primary_10_1016_S0743_1066_99_00066_7 elsevier_sciencedirect_doi_10_1016_S0743_1066_99_00066_7
PublicationCentury	2000
PublicationDate	2000-11-01
PublicationDateYYYYMMDD	2000-11-01
PublicationDate_xml	– month: 11 year: 2000 text: 2000-11-01 day: 01
PublicationDecade	2000
PublicationTitle	The journal of logic programming
PublicationYear	2000
Publisher	Elsevier Inc
Publisher_xml	– name: Elsevier Inc
References	Progress Report, Comparisons and Benchmarks, in: KR-98: Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning, 1998, pp. 406–417 Chandra, Harel (BIB11) 1985; 2 Immerman (BIB24) 1987; 16 Johnson (BIB25) 1990 Papadimitriou (BIB30) 1985; 26 Van Gelder (BIB37) 1993; 47 Ben-Eliyahu, Palopoli (BIB6) 1997; 96 Schlipf (BIB33) 1995; 51 M. Baudinet, J. Chomicki, P. Wolper, Temporal deductive databases, in: Tansel et al. (Eds.), Temporal Databases: Theory, Design and Implementation, Benjamin/Cummings, Menlo Park, CA, 1993 J. Minker, On indefinite databases and the closed world assumption, Proceedings of the 6th CADE, LNCS 138, Springer Verlag, Berlin, 1982, pp. 292–308 Abiteboul, Simon, Vianu (BIB2) 1990 Cadoli, Lenzerini (BIB8) 1994; 48 Eiter, Leone, Saccá (BIB18) 1998; 206 Shmueli (BIB34) 1987 Kolaitis (BIB26) 1991; 90 R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in: R.M. Karp (Ed.), Complexity of Computation, AMS, 1974, pp. 43–74 Ullman (BIB36) 1988 Eiter, Gottlob, Mannila (BIB16) 1997; 22 Abiteboul, Vianu (BIB3) 1991; 3 C. Koch, N. Leone, Stable model checking made easy, IJCAI-1999 pp. 70–75 Immerman (BIB23) 1986; 68 J. Dix, Semantics of logic programs: their intuitions and formal properties. An overview. in: Logic Action and Information, Proceedings of the Konstanz Colloquium in Logic and Information, DeGruyter, Berlin, 1992, pp. 241–329 F. Giannotti, D. Pedreschi, D. Saccá, C. Zaniolo, Non-determinism in deductive databases, in: Proceedings of the Second International Conference on Deductive and Object Oriented Databases, 1991, pp. 129–146 Chomicki (BIB12) 1990 Przymusinski (BIB31) 1988 Van Gelder, Ross, Schlipf (BIB38) 1991; 38 M. Vardi, The complexity of relational query languages, in: Proceedings of the 14th ACM STOC, 1982 pp. 137–146 G. Gottlob, Complexity and expressive power of disjunctive logic programming, Invited paper, Proc. ICLP, 1994 T. Eiter, N. Leone, C. Mateis, G. Pfeifer, F. Scarcello, The KR system Tarjan (BIB35) 1972; 1 Ben-Eliyahu, Dechter (BIB5) 1994; 12 Abiteboul, Hull, Vianu (BIB1) 1994 Chandra, Harel (BIB9) 1980; 21 E. Dantsin, T. Eiter, G. Gottlob, A. Voronkov, Complexity and expressive power of Logic Programming, in: Proceedings of the 12th IEEE Conference on Computational Complexity, Ulm, 1997 Gelfond, Lifschitz (BIB20) 1991; 9 Przymusinski (BIB32) 1991; 9 Eiter, Gottlob (BIB15) 1995; 15 Chandra, Harel (BIB10) 1982; 25 C. Zaniolo, N. Arni, K. Ong, Negation and aggregates in recursive rules: the LDL++ approach, in: Proceedings of the Third International Conference on Deductive and Object Oriented Databases, 1993, pp. 204–221 Lobo, Minker, Rajasekar (BIB28) 1992 M. Cadoli, On the complexity of model finding for non-monotonic propositional logics, in: Proceedings of the Fourth Italian Conference on Theoretical Computer Science, World Scientific, Singapore, 1992, pp. 125–139 Papadimitriou (10.1016/S0743-1066(99)00066-7_BIB30) 1985; 26 Chandra (10.1016/S0743-1066(99)00066-7_BIB11) 1985; 2 Kolaitis (10.1016/S0743-1066(99)00066-7_BIB26) 1991; 90 Przymusinski (10.1016/S0743-1066(99)00066-7_BIB32) 1991; 9 Tarjan (10.1016/S0743-1066(99)00066-7_BIB35) 1972; 1 Eiter (10.1016/S0743-1066(99)00066-7_BIB16) 1997; 22 Chomicki (10.1016/S0743-1066(99)00066-7_BIB12) 1990 Lobo (10.1016/S0743-1066(99)00066-7_BIB28) 1992 Chandra (10.1016/S0743-1066(99)00066-7_BIB10) 1982; 25 Van Gelder (10.1016/S0743-1066(99)00066-7_BIB37) 1993; 47 Przymusinski (10.1016/S0743-1066(99)00066-7_BIB31) 1988 10.1016/S0743-1066(99)00066-7_BIB14 Schlipf (10.1016/S0743-1066(99)00066-7_BIB33) 1995; 51 10.1016/S0743-1066(99)00066-7_BIB13 Abiteboul (10.1016/S0743-1066(99)00066-7_BIB1) 1994 Eiter (10.1016/S0743-1066(99)00066-7_BIB18) 1998; 206 Immerman (10.1016/S0743-1066(99)00066-7_BIB24) 1987; 16 Chandra (10.1016/S0743-1066(99)00066-7_BIB9) 1980; 21 10.1016/S0743-1066(99)00066-7_BIB17 10.1016/S0743-1066(99)00066-7_BIB39 10.1016/S0743-1066(99)00066-7_BIB19 Cadoli (10.1016/S0743-1066(99)00066-7_BIB8) 1994; 48 Shmueli (10.1016/S0743-1066(99)00066-7_BIB34) 1987 Ben-Eliyahu (10.1016/S0743-1066(99)00066-7_BIB5) 1994; 12 10.1016/S0743-1066(99)00066-7_BIB7 Eiter (10.1016/S0743-1066(99)00066-7_BIB15) 1995; 15 Ben-Eliyahu (10.1016/S0743-1066(99)00066-7_BIB6) 1997; 96 Ullman (10.1016/S0743-1066(99)00066-7_BIB36) 1988 10.1016/S0743-1066(99)00066-7_BIB40 10.1016/S0743-1066(99)00066-7_BIB21 Gelfond (10.1016/S0743-1066(99)00066-7_BIB20) 1991; 9 10.1016/S0743-1066(99)00066-7_BIB22 10.1016/S0743-1066(99)00066-7_BIB4 Johnson (10.1016/S0743-1066(99)00066-7_BIB25) 1990 Immerman (10.1016/S0743-1066(99)00066-7_BIB23) 1986; 68 Abiteboul (10.1016/S0743-1066(99)00066-7_BIB2) 1990 10.1016/S0743-1066(99)00066-7_BIB27 Abiteboul (10.1016/S0743-1066(99)00066-7_BIB3) 1991; 3 10.1016/S0743-1066(99)00066-7_BIB29 Van Gelder (10.1016/S0743-1066(99)00066-7_BIB38) 1991; 38
References_xml	– volume: 21 start-page: 156 year: 1980 end-page: 178 ident: BIB9 article-title: Computable queries for relational databases publication-title: Journal of Computer and System Science – start-page: 379 year: 1990 end-page: 391 ident: BIB12 article-title: Polynomial time query processing in temporal deductive databases publication-title: Proc. ACM PODS – reference: E. Dantsin, T. Eiter, G. Gottlob, A. Voronkov, Complexity and expressive power of Logic Programming, in: Proceedings of the 12th IEEE Conference on Computational Complexity, Ulm, 1997 – volume: 15 start-page: 289 year: 1995 end-page: 323 ident: BIB15 article-title: On the computational cost of disjunctive logic programming: propositional case publication-title: Annals of Mathematics and Artificial Intelligence – volume: 51 start-page: 64 year: 1995 end-page: 86 ident: BIB33 article-title: The expressive powers of logic programming semantics publication-title: Journal of Computer and System Science – volume: 48 start-page: 255 year: 1994 end-page: 310 ident: BIB8 article-title: The complexity of closed world reasoning publication-title: Journal of Computer and System Science – year: 1992 ident: BIB28 publication-title: Foundations of disjunctive logic programming – reference: T. Eiter, N. Leone, C. Mateis, G. Pfeifer, F. Scarcello, The KR system – reference: F. Giannotti, D. Pedreschi, D. Saccá, C. Zaniolo, Non-determinism in deductive databases, in: Proceedings of the Second International Conference on Deductive and Object Oriented Databases, 1991, pp. 129–146 – reference: G. Gottlob, Complexity and expressive power of disjunctive logic programming, Invited paper, Proc. ICLP, 1994 – volume: 206 start-page: 181 year: 1998 end-page: 218 ident: BIB18 article-title: The expressive power of partial stable model semantics publication-title: Theoretical Computer Science – reference: R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in: R.M. Karp (Ed.), Complexity of Computation, AMS, 1974, pp. 43–74 – start-page: 218 year: 1990 end-page: 229 ident: BIB2 article-title: Non-deterministic languages to express deterministic transformations publication-title: Proc. ACM PODS – reference: M. Cadoli, On the complexity of model finding for non-monotonic propositional logics, in: Proceedings of the Fourth Italian Conference on Theoretical Computer Science, World Scientific, Singapore, 1992, pp. 125–139 – start-page: 67 year: 1990 end-page: 162 ident: BIB25 article-title: A catalog of complexity classes publication-title: Handbook of Theoretical Computer Science – volume: 38 start-page: 620 year: 1991 end-page: 650 ident: BIB38 article-title: The well-founded semantics for general logic programs publication-title: Journal of the ACM – volume: 9 start-page: 365 year: 1991 end-page: 385 ident: BIB20 article-title: Classical negation in logic programs and disjunctive databases publication-title: New Generation Computing – volume: 2 start-page: 1 year: 1985 end-page: 15 ident: BIB11 article-title: Horn clause queries and generalizations publication-title: Journal of Logic Programming – volume: 3 year: 1991 ident: BIB3 article-title: Non-determinism in logic-based languages publication-title: Annals on Mathematics and AI – reference: J. Dix, Semantics of logic programs: their intuitions and formal properties. An overview. in: Logic Action and Information, Proceedings of the Konstanz Colloquium in Logic and Information, DeGruyter, Berlin, 1992, pp. 241–329 – volume: 1 start-page: 146 year: 1972 end-page: 160 ident: BIB35 article-title: Depth-first search and linear graph algorithms publication-title: SIAM Journal on Computing – year: 1994 ident: BIB1 publication-title: Foundations of Databases – start-page: 193 year: 1988 end-page: 216 ident: BIB31 article-title: On the declarative semantics of deductive databases and logic programs publication-title: Foundations of Deductive Databases and Logic Programs – reference: C. Zaniolo, N. Arni, K. Ong, Negation and aggregates in recursive rules: the LDL++ approach, in: Proceedings of the Third International Conference on Deductive and Object Oriented Databases, 1993, pp. 204–221 – volume: 96 start-page: 421 year: 1997 end-page: 449 ident: BIB6 article-title: Reasoning with minimal models: efficient algorithms and applications publication-title: Artificial Intelligence – volume: 90 start-page: 50 year: 1991 end-page: 66 ident: BIB26 article-title: On the expressive power of stratified logic programs publication-title: Information and Computation – reference: M. Baudinet, J. Chomicki, P. Wolper, Temporal deductive databases, in: Tansel et al. (Eds.), Temporal Databases: Theory, Design and Implementation, Benjamin/Cummings, Menlo Park, CA, 1993 – volume: 25 start-page: 99 year: 1982 end-page: 128 ident: BIB10 article-title: Structure and complexity of relational queries publication-title: Journal of Computer and System Science – volume: 22 start-page: 315 year: 1997 end-page: 363 ident: BIB16 article-title: Disjunctive datalog publication-title: ACM Transactions on Database Systems – reference: : Progress Report, Comparisons and Benchmarks, in: KR-98: Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning, 1998, pp. 406–417 – volume: 12 start-page: 53 year: 1994 end-page: 87 ident: BIB5 article-title: Propositional semantics for disjunctive logic programs publication-title: Annals of Mathematics and Artificial Intelligence – start-page: 237 year: 1987 end-page: 249 ident: BIB34 article-title: Decidability adn expressiveness aspects of logic queries publication-title: Proc. ACM PODS – volume: 47 start-page: 185 year: 1993 end-page: 221 ident: BIB37 article-title: The alternating fixpoint of logic programs with negation publication-title: Journal of Computer and System Science – year: 1988 ident: BIB36 publication-title: Database and Knowledge base systems – reference: C. Koch, N. Leone, Stable model checking made easy, IJCAI-1999 pp. 70–75 – volume: 9 start-page: 401 year: 1991 end-page: 424 ident: BIB32 article-title: Stable model semantics for disjunctive programs publication-title: New generation computing – volume: 26 start-page: 21 year: 1985 end-page: 23 ident: BIB30 article-title: A note on the expressive power of Prolog publication-title: Bulletin of the EATCS – reference: M. Vardi, The complexity of relational query languages, in: Proceedings of the 14th ACM STOC, 1982 pp. 137–146 – volume: 16 start-page: 760 year: 1987 end-page: 778 ident: BIB24 article-title: Languages that capture complexity classes publication-title: SIAM Journal on Computing – reference: J. Minker, On indefinite databases and the closed world assumption, Proceedings of the 6th CADE, LNCS 138, Springer Verlag, Berlin, 1982, pp. 292–308 – volume: 68 start-page: 86 year: 1986 end-page: 104 ident: BIB23 article-title: Relational queries computable in polynomial time publication-title: Information and Control – year: 1992 ident: 10.1016/S0743-1066(99)00066-7_BIB28 – volume: 206 start-page: 181 issue: 1–2 year: 1998 ident: 10.1016/S0743-1066(99)00066-7_BIB18 article-title: The expressive power of partial stable model semantics publication-title: Theoretical Computer Science doi: 10.1016/S0304-3975(97)00129-1 – volume: 21 start-page: 156 year: 1980 ident: 10.1016/S0743-1066(99)00066-7_BIB9 article-title: Computable queries for relational databases publication-title: Journal of Computer and System Science doi: 10.1016/0022-0000(80)90032-X – volume: 3 issue: II–IV year: 1991 ident: 10.1016/S0743-1066(99)00066-7_BIB3 article-title: Non-determinism in logic-based languages publication-title: Annals on Mathematics and AI – ident: 10.1016/S0743-1066(99)00066-7_BIB22 – volume: 90 start-page: 50 year: 1991 ident: 10.1016/S0743-1066(99)00066-7_BIB26 article-title: On the expressive power of stratified logic programs publication-title: Information and Computation doi: 10.1016/0890-5401(91)90059-B – volume: 38 start-page: 620 issue: 3 year: 1991 ident: 10.1016/S0743-1066(99)00066-7_BIB38 article-title: The well-founded semantics for general logic programs publication-title: Journal of the ACM doi: 10.1145/116825.116838 – ident: 10.1016/S0743-1066(99)00066-7_BIB13 doi: 10.1109/CCC.1997.612304 – start-page: 193 year: 1988 ident: 10.1016/S0743-1066(99)00066-7_BIB31 article-title: On the declarative semantics of deductive databases and logic programs – ident: 10.1016/S0743-1066(99)00066-7_BIB7 – ident: 10.1016/S0743-1066(99)00066-7_BIB17 – volume: 51 start-page: 64 issue: 1 year: 1995 ident: 10.1016/S0743-1066(99)00066-7_BIB33 article-title: The expressive powers of logic programming semantics publication-title: Journal of Computer and System Science doi: 10.1006/jcss.1995.1053 – ident: 10.1016/S0743-1066(99)00066-7_BIB19 – year: 1988 ident: 10.1016/S0743-1066(99)00066-7_BIB36 – ident: 10.1016/S0743-1066(99)00066-7_BIB39 doi: 10.1145/800070.802186 – start-page: 218 year: 1990 ident: 10.1016/S0743-1066(99)00066-7_BIB2 article-title: Non-deterministic languages to express deterministic transformations publication-title: Proc. ACM PODS doi: 10.1145/298514.298575 – ident: 10.1016/S0743-1066(99)00066-7_BIB27 – volume: 16 start-page: 760 year: 1987 ident: 10.1016/S0743-1066(99)00066-7_BIB24 article-title: Languages that capture complexity classes publication-title: SIAM Journal on Computing doi: 10.1137/0216051 – volume: 9 start-page: 401 year: 1991 ident: 10.1016/S0743-1066(99)00066-7_BIB32 article-title: Stable model semantics for disjunctive programs publication-title: New generation computing doi: 10.1007/BF03037171 – volume: 47 start-page: 185 year: 1993 ident: 10.1016/S0743-1066(99)00066-7_BIB37 article-title: The alternating fixpoint of logic programs with negation publication-title: Journal of Computer and System Science doi: 10.1016/0022-0000(93)90024-Q – volume: 25 start-page: 99 year: 1982 ident: 10.1016/S0743-1066(99)00066-7_BIB10 article-title: Structure and complexity of relational queries publication-title: Journal of Computer and System Science doi: 10.1016/0022-0000(82)90012-5 – ident: 10.1016/S0743-1066(99)00066-7_BIB29 doi: 10.1007/BFb0000066 – volume: 9 start-page: 365 year: 1991 ident: 10.1016/S0743-1066(99)00066-7_BIB20 article-title: Classical negation in logic programs and disjunctive databases publication-title: New Generation Computing doi: 10.1007/BF03037169 – volume: 12 start-page: 53 issue: I–II year: 1994 ident: 10.1016/S0743-1066(99)00066-7_BIB5 article-title: Propositional semantics for disjunctive logic programs publication-title: Annals of Mathematics and Artificial Intelligence doi: 10.1007/BF01530761 – volume: 22 start-page: 315 issue: 3 year: 1997 ident: 10.1016/S0743-1066(99)00066-7_BIB16 article-title: Disjunctive datalog publication-title: ACM Transactions on Database Systems doi: 10.1145/261124.261126 – ident: 10.1016/S0743-1066(99)00066-7_BIB40 doi: 10.1007/3-540-57530-8_13 – start-page: 379 year: 1990 ident: 10.1016/S0743-1066(99)00066-7_BIB12 article-title: Polynomial time query processing in temporal deductive databases publication-title: Proc. ACM PODS doi: 10.1145/298514.298589 – volume: 1 start-page: 146 year: 1972 ident: 10.1016/S0743-1066(99)00066-7_BIB35 article-title: Depth-first search and linear graph algorithms publication-title: SIAM Journal on Computing doi: 10.1137/0201010 – start-page: 67 year: 1990 ident: 10.1016/S0743-1066(99)00066-7_BIB25 article-title: A catalog of complexity classes – year: 1994 ident: 10.1016/S0743-1066(99)00066-7_BIB1 – ident: 10.1016/S0743-1066(99)00066-7_BIB4 – volume: 15 start-page: 289 year: 1995 ident: 10.1016/S0743-1066(99)00066-7_BIB15 article-title: On the computational cost of disjunctive logic programming: propositional case publication-title: Annals of Mathematics and Artificial Intelligence doi: 10.1007/BF01536399 – ident: 10.1016/S0743-1066(99)00066-7_BIB14 – volume: 26 start-page: 21 year: 1985 ident: 10.1016/S0743-1066(99)00066-7_BIB30 article-title: A note on the expressive power of Prolog publication-title: Bulletin of the EATCS – volume: 48 start-page: 255 year: 1994 ident: 10.1016/S0743-1066(99)00066-7_BIB8 article-title: The complexity of closed world reasoning publication-title: Journal of Computer and System Science doi: 10.1016/S0022-0000(05)80004-2 – volume: 68 start-page: 86 year: 1986 ident: 10.1016/S0743-1066(99)00066-7_BIB23 article-title: Relational queries computable in polynomial time publication-title: Information and Control doi: 10.1016/S0019-9958(86)80029-8 – volume: 96 start-page: 421 issue: 2 year: 1997 ident: 10.1016/S0743-1066(99)00066-7_BIB6 article-title: Reasoning with minimal models: efficient algorithms and applications publication-title: Artificial Intelligence doi: 10.1016/S0004-3702(97)00060-X – ident: 10.1016/S0743-1066(99)00066-7_BIB21 doi: 10.1007/3-540-55015-1_7 – volume: 2 start-page: 1 issue: 1 year: 1985 ident: 10.1016/S0743-1066(99)00066-7_BIB11 article-title: Horn clause queries and generalizations publication-title: Journal of Logic Programming doi: 10.1016/0743-1066(85)90002-0 – start-page: 237 year: 1987 ident: 10.1016/S0743-1066(99)00066-7_BIB34 article-title: Decidability adn expressiveness aspects of logic queries publication-title: Proc. ACM PODS
SSID	ssj0001115
Score	1.2985651
Snippet	Sometimes it is more natural to express knowledge in disjunctive Datalog rather than in ordinary Datalog. Several highly complex variants of disjunctive...
SourceID	proquest crossref elsevier
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	61
SubjectTerms	Disjunctive logic programming Expressive power of query languages Head-cycle-free programs Non-deterministic semantics Polynomial-time queries
Title	More on tractable disjunctive Datalog
URI	https://dx.doi.org/10.1016/S0743-1066(99)00066-7 https://www.proquest.com/docview/27608255
Volume	46
WOSCitedRecordID	wos000089821000002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-5789 dateEnd: 20001231 omitProxy: false ssIdentifier: ssj0001115 issn: 0743-1066 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF5ByoELLS_RlocPBMFhqbP2vo5VlQpQCRWkKOKyWq_X1Ci10zxQ--_Zl-0AQoEDFyuysmNp5tPM7DwBeC4ZJoUiDGa8IOaCQjOYaZRAkhuA5CTnqkjdsgk6GrHJhJ-GgQoLt06AVhW7uuKz_ypq884I27bO_oO4W6LmhflthG6eRuzm-VeCf1_PtUsB2P4n3xhVLr4Z8-WLhHy4Zt0ntUhZGyDhlGFTt3XRWDbXylPB4bS8lucr-KU-lz4B_9FOhG7LNE4Ncbv3wV33V-XXsg1M64vptaxCDcfn0uYKSvlTzCEOzXedanKDTWO_L6XRoyGUuI4XrxT9tPVgXgeezm-a2wcRPrWU-_Ym2EfcOUWQduaqSdGPPojjs5MTMR5Oxi9ml9AuErMJ97BV5SbYQhRz1gNbh2-Hk3eteTbKHbezWQ3trq3roPv6S85fhS__yWH5xXQ7f2S8A-6Ei0R06AFwF9zQ1T2w3SzpiILOvg_6Fg9RXUUtHqI1PEQBDw_A2fFwfPQGht0YUCUJW0JNcoKU5BkpaM5QxrXGmUKIF4gxnUo90CmRHBcxzgeI6gHhKUmocR4V1jnSyUPQq-pKPwIRZdJoYqWIlDgtYpZxpnlWkBzTWFMd74K0YYBQYXC83V8yFV2FoOGbsHwTnAvHN0F3wev22MxPTtl0gDXcFcH9826dMBjZdPRZIw1h1KPNeclK16uFQJTYIAje2_iPfXC7g_pj0FvOV_oJuKW-L8vF_GlA0Q-KsIAd
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=More+on+tractable+disjunctive+Datalog&rft.jtitle=The+journal+of+logic+programming&rft.au=Ben-Eliyahu-Zohary%2C+Rachel&rft.au=Palopoli%2C+Luigi&rft.au=Zemlyanker%2C+Victoria&rft.date=2000-11-01&rft.issn=0743-1066&rft.volume=46&rft.issue=1&rft.spage=61&rft.epage=101&rft_id=info:doi/10.1016%2FS0743-1066%2899%2900066-7&rft.externalDBID=NO_FULL_TEXT
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-1066&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-1066&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-1066&client=summon