{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,18]],"date-time":"2023-04-18T05:29:48Z","timestamp":1681795788064},"reference-count":268,"publisher":"Elsevier","license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1016\/b978-0-444-51624-4.50013-7","type":"book-chapter","created":{"date-parts":[[2014,12,9]],"date-time":"2014-12-09T19:00:55Z","timestamp":1418151655000},"page":"571-627","source":"Crossref","is-referenced-by-count":6,"title":["Logic and Databases: A History of Deductive Databases"],"prefix":"10.1016","author":[{"given":"Jack","family":"Minker","sequence":"first","affiliation":[]},{"given":"Dietmar","family":"Seipel","sequence":"additional","affiliation":[]},{"given":"Carlo","family":"Zaniolo","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0005","author":"Abiteboul"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0010","first-page":"293","article-title":"A Rule\u2013Based Language for Web Data, Management","author":"Abiteboul","year":"2011","journal-title":"PODS\u201911"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0015","first-page":"89","article-title":"Towards a Theory of Declarative Knowledge","author":"Apt","year":"1988"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0020","first-page":"342","article-title":"DisLoP: Towards a Disjunctive Logic Programming System","author":"Aravindan","year":"1997"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0025","doi-asserted-by":"crossref","first-page":"125","DOI":"10.3233\/AIC-2011-0492","article-title":"Dynamic Magic Sets and Super\u2013Coherent Answer Set Programs","volume":"24","author":"Alviano","year":"2011","journal-title":"AI Commun."},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0030","series-title":"Foundations of Databases","author":"Abiteboul","year":"1995"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0035","first-page":"61","article-title":"The Deductive Database System \u2112D\u2112 ++","volume":"3","author":"Arni","year":"2003","journal-title":"TPLP"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0040","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1005900924623","article-title":"\"Classical\" Negation in NMR and LP","volume":"20","author":"Alferes","year":"1998","journal-title":"JAR"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0045","series-title":"Handbook of Theoretical Computer Science","first-page":"493","article-title":"Logic Programming","author":"Apt","year":"1990"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0050","series-title":"Knowledge Representation, Reasoning and Declarative Problem Solving","author":"Baral","year":"2004"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0055","first-page":"3","article-title":"Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative","author":"Borchert","year":"2004","journal-title":"LPNMR\u201904"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0060","series-title":"Scaling Datalog for Machine Learning on Big Data","author":"Bu","year":"2012"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_rf0065","series-title":"Nonmonotonic Extensions of Logic Programming","first-page":"127","article-title":"A General Approach to Bottom\u2013Up Computation of Disjunctive Semantics","author":"Brass","year":"1995"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0070","first-page":"167","article-title":"Semantics of (Disjunctive) Logic Programs Based on Partial Evaluation","volume":"38","author":"Brass","year":"1999","journal-title":"JLP"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0075","first-page":"74","article-title":"A Comparison of the Static and the Disjunctive Well\u2013Founded Semantics and its Implementation","author":"Brass","year":"1998"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0080","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0304-3975(95)00192-1","article-title":"Querying Disjunctive Databases through Nonmonotonic Logics","volume":"160","author":"Bonatti","year":"1996","journal-title":"TCS"},{"issue":"1\u20132","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0085","first-page":"297","article-title":"Preferred Answer Sets for Extended Logic Programs","volume":"109","author":"Brewka","year":"1999","journal-title":"JAI"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0090","first-page":"53","article-title":"Propositional Semantics for Disjunctive Logic Programs","volume":"12","author":"Ben\u2013Eliyahu","year":"1994","journal-title":"AMAI"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0095","first-page":"39","article-title":"Reasoning with Minimal Models: Efficient Algorithms and Applications","author":"Ben\u2013Eliyahu","year":"1994","journal-title":"KR\u201994"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0100","first-page":"345","article-title":"The Expressive Power of Tractable Disjunction","author":"Ben\u2013Eliyahu","year":"1996","journal-title":"ECAI\u201996"},{"issue":"12","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0105","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1145\/2043174.2043195","article-title":"Answer Set Programming at a Glance","volume":"54","author":"Brewka","year":"2011","journal-title":"CACM"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0110","first-page":"119","article-title":"Visual Web Information Extraction with Lixto","author":"Baumgartner","year":"2001","journal-title":"VLDB\u201901"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0115","first-page":"293","article-title":"Disjunctive Logic Programs with Inheritance","volume":"2","author":"Buccafurri","year":"2002","journal-title":"TPLP"},{"issue":"20","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0120","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0743-1066(94)90025-6","article-title":"Logic Programming and Knowledge Representation","volume":"19","author":"Baral","year":"1994","journal-title":"JLP"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0125","first-page":"253","article-title":"Reasoning Agents in Dynamic Domains","author":"Baral","year":"2000"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0130","first-page":"55","article-title":"Probabilistic Reasoning with Answer Sets","volume":"9","author":"Baral","year":"2009","journal-title":"TPLP"},{"issue":"5","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0135","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1109\/69.877512","article-title":"Enhancing Disjunctive Datalog by Constraints","volume":"12","author":"Buccafurri","year":"2000","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0140","first-page":"1","article-title":"Magic Sets and other Strange Ways to Implement Logic Programs","author":"Bancilhon","year":"1986","journal-title":"PODS\u201986"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0145","first-page":"139","volume":"19","author":"Brewka","year":"1998"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0150","first-page":"335","article-title":"Logic Programs with Ordered Disjunction","volume":"20","author":"Brewka","year":"2004","journal-title":"JCI"},{"issue":"4","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0155","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1609\/aimag.v29i4.2179","article-title":"Preferences and Nonmonotonic Reasoning","volume":"29","author":"Brewka","year":"2008","journal-title":"AI Magazine"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0160","year":"2012"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0165","first-page":"269","article-title":"On the Power of Magic","author":"Beeri","year":"1987","journal-title":"PODS\u201987"},{"issue":"4","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0170","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0169-023X(90)90017-8","article-title":"Query Evaluation in Deductive Databases: Bottom\u2013Up and Top\u2013Down Reconciled","volume":"5","author":"Bry","year":"1990","journal-title":"Journal of Data & Knowledge Engineering"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0175","first-page":"39","article-title":"Semantical and Computational Aspects of Horn Approximations","author":"Cadoli","year":"1993","journal-title":"IJCAI\u201993"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0180","first-page":"183","article-title":"Panel on Knowledge Compilation and Approximation: Terminology, Questions, References","author":"Cadoli","year":"1996"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0185","first-page":"371","article-title":"Enhancing the Magic-Set Method for Disjunctive Datalog Programs","author":"Cumbo","year":"2004"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_rf0190","series-title":"Logic Programming and Databases","author":"Ceri","year":"1990"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0195","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/69.50907","article-title":"The \u2112D\u2112 System Prototype","volume":"2","author":"Chimenti","year":"1990","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0200","doi-asserted-by":"crossref","DOI":"10.1145\/78922.78924","article-title":"Logic Based Approach to Semantic Query Optimization","volume":"15","author":"Chakravarthy","year":"1990","journal-title":"ACM TODS"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0205","series-title":"New Expressive Languages for Ontological Query Answering","author":"Cal\u00ed","year":"2011"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0210","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0743-1066(85)90002-0","article-title":"Horn Clause Queries and Generalizations","volume":"2","author":"Chandra","year":"1985","journal-title":"JLP"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0215","first-page":"34","article-title":"An Overview of Query Optimization in Relational Systems","author":"Chaudhuri","year":"1998","journal-title":"PODS\u201998"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0220","first-page":"201","article-title":"Deduce 2: Further Investigations of Deduction in Relational Databases","author":"Chang","year":"1978"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0225","author":"Calimeri"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0230","first-page":"165","article-title":"The Complexity of Closed World Reasoning and Circumscription","volume":"43","author":"Cadoli","year":"1994","journal-title":"JCSS"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0235","first-page":"293","article-title":"Negation-as-Failure","author":"Clark","year":"1978"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0240","first-page":"518","article-title":"Default Reasoning System DeReS","volume":"1996","author":"Cholewinski","year":"1996","journal-title":"KR"},{"issue":"6","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0245","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/362384.362685","article-title":"A Relational Model of Data for Large Shared Data Banks","volume":"13","author":"Codd","year":"1970","journal-title":"CACM"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0250","series-title":"Un Systeme de Communication Homme-Machine en Francais","author":"Colmerauer","year":"1973"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0255","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0020-0190(90)90012-M","article-title":"Generalized Closed World Assumption is \u03c002\u2212complete","volume":"34","author":"Chomicki","year":"1990","journal-title":"Inf. Processing Letters"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0260","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/0743-1066(93)90029-G","article-title":"A Survey of Complexity Results for Non-Monotonic Logics","volume":"13","author":"Cadoli","year":"1993","journal-title":"JLP"},{"issue":"2\u20134","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0265","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0743-1066(93)90034-E","article-title":"A Goal-Oriented Approach to Computing the Well-Founded Semantics","volume":"17","author":"Chen","year":"1993","journal-title":"JLP"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0270","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1145\/502807.502810","article-title":"Complexity and Expressive Power of Logic Programming","volume":"33","author":"Dantsin","year":"2001","journal-title":"ACM Comp. Surveys"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0275","article-title":"An Analysis of Approximate Knowledge Compilation","author":"del Val","year":"1995","journal-title":"IJCAI\u201995"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0280","first-page":"422","article-title":"Conflict\u2013Driven Disjunctive Answer Set Solving","author":"Drescher","year":"2008"},{"issue":"1,2","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0285","doi-asserted-by":"crossref","first-page":"87","DOI":"10.3233\/FI-1996-281205","article-title":"Reducing Disjunctive to nondisjunctive Semantics by shift operations","volume":"28","author":"Dix","year":"1996","journal-title":"Fundamenta Informaticae"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0290","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1145\/321510.321524","article-title":"The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas","volume":"16","author":"DiPaola","year":"1969","journal-title":"JACM"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0295","first-page":"798","article-title":"Classifying Semantics of Disjunctive Logic Programs","author":"Dix","year":"1992"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0300","doi-asserted-by":"crossref","first-page":"227","DOI":"10.3233\/FI-1995-2233","article-title":"A Classification\u2013Theory of Semantics of Normal Logic Programs: I. Strong Properties and II. Weak Properties","volume":"XXII","author":"Dix","year":"1995","journal-title":"Fund. Informaticae"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0305","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1093\/jigpal\/4.3.369","article-title":"Integrity Constraints Revisited","volume":"4","author":"Demolombe","year":"1996","journal-title":"Journal of the IGPL: An Elect. J. on Pure and Applied Logic"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0310","first-page":"260","article-title":"Clasp: A Conflict\u2013Driven Answer Set Solver","author":"Gebser","year":"2007","journal-title":"LPNMR\u201907"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_rf0315","series-title":"REVISE: Logic Programming and Diagnosis","first-page":"1265","author":"Damasio","year":"1997"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0320","first-page":"807","article-title":"Planning under incomplete knowledge","author":"Eiter","year":"2000"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0325","first-page":"79","article-title":"Declarative problem solving using the DLV System","author":"Eiter","year":"2000"},{"issue":"3\u20134","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0330","first-page":"289","article-title":"On the Computation Cost of Disjunctive Logic Programming: Propositional Case","volume":"15","author":"Eiter","year":"1995","journal-title":"AMAI"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0335","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0743-1066(97)00027-7","article-title":"Expressiveness of Stable Model Semantics for Disjunctive Logic Programs with Functions","volume":"33","author":"Eiter","year":"1997","journal-title":"JLP"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0340","doi-asserted-by":"crossref","first-page":"364","DOI":"10.1145\/261124.261126","article-title":"Disjunctive Datalog","volume":"22","author":"Eiter","year":"1997","journal-title":"ACM TODS"},{"issue":"12\u201313","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0345","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1016\/j.artint.2008.04.002","article-title":"Combining Answer Set Programming with Description Logics for the Semantic Web","volume":"172","author":"Eiter","year":"2008","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0350","first-page":"59","article-title":"On the Partial Semantics for Disjunctive Deductive Databases","volume":"19","author":"Eiter","year":"1997","journal-title":"AMAI"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0355","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF00244495","article-title":"Model Theoretic Approach to View Updates in Deductive Databases","volume":"17","author":"Fern\u00e1ndez","year":"1996","journal-title":"JAR"},{"issue":"3\u20134","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0360","first-page":"449","article-title":"Disjunctive LP+Integrity Constraints=Stable Model Semantics","volume":"8","author":"Fern\u00e1ndez","year":"1993","journal-title":"AMAI"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0365","first-page":"274","article-title":"Aggregate Functions in DLV","author":"Faber","year":"2003"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0370","first-page":"278","article-title":"Semantics and Complexity of Recursive Aggregates in Answer Set Programming","volume":"175","author":"Faber","year":"2011","journal-title":"AI"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0375","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0014147","article-title":"VALIDITY: Applications of a DOOD System","author":"Friesen","year":"1996"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0380","first-page":"660","article-title":"Bottom\u2013Up Evaluation of Hierarchical Disjunctive Deductive Databases","author":"Fern\u00e1ndez","year":"1991"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0385","first-page":"332","article-title":"Semantics of Disjunctive Deductive Databases","author":"Fern\u00e1ndez","year":"1992"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0390","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0743-1066(94)00106-G","article-title":"Bottom\u2013Up Computation of Perfect Models for Disjunctive Theories","volume":"25","author":"Fern\u00e1ndez","year":"1995","journal-title":"JLP"},{"issue":"5\u20136","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0395","first-page":"545","article-title":"Design and Implementation of Aggregate Functions in the DLV System","volume":"8","author":"Faber","year":"2008","journal-title":"TPLP"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0400","first-page":"317","article-title":"ASPIDE: Integrated Development Environment for Answer Set Programming","author":"Febbraro","year":"2011"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0405","series-title":"Cooperative Answers for Database Queries","author":"Gaasterland","year":"1992"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0410","first-page":"1","article-title":"Logicblox, Platform and Language: A Tutorial","author":"Green","year":"2012"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0415","article-title":"A Natural Language Database Interface that Provides Cooperative Answers","author":"Gal","year":"1985"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0420","article-title":"Answer Sets in KR: A Personal Perspective","volume":"19","author":"Gelfond","year":"2006","journal-title":"Association for Logic Programming"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0425","first-page":"207","article-title":"On Stratified Autoepistemic Theories","author":"Gelfond","year":"1987","journal-title":"Proc. AAAI\u201987"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_rf0430","first-page":"1","article-title":"The Lixto Data Extraction Project \u2013Back and Forth Between Theory and Practice","author":"Gottlob","year":"2004","journal-title":"Proc. PODS\u201904"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0435","first-page":"509","author":"Gebser","year":"2009"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0440","first-page":"54","article-title":"Reactive Answer Set Programming","author":"Gebser","year":"2011","journal-title":"LPNMR\u201911"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0445","first-page":"293","article-title":"Relaxation as a Platform for Cooperative Answering","volume":"1","author":"Gaasterland","year":"1992","journal-title":"JIIS"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0450","first-page":"123","article-title":"An Overview of Cooperative Answering","volume":"1","author":"Gaasterland","year":"1992","journal-title":"JIIS"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0455","article-title":"Semantic Query Evaluation for Bottom\u2013Up","author":"Godfrey","year":"1996","journal-title":"Evaluation. ISMIS\u201996"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0460","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/BF00881907","article-title":"View Updates in Stratified Disjunctive Databases","volume":"11","author":"Grant","year":"1993","journal-title":"JAR"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0465","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/962446.962450","article-title":"Monadic Datalog and the Expressive Power of Languages for Web Information Extraction","volume":"51","author":"Gottlob","year":"2004","journal-title":"JACM"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0470","first-page":"1070","article-title":"The Stable Model Semantics for Logic Programming","author":"Gelfond","year":"1988"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0475","series-title":"ICLP\u201990","first-page":"579","article-title":"Logic Programs with Classical Negation","author":"Gelfond","year":"1990"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0480","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classical Negation in Logic Programs and Disjunctive Databases","volume":"9","author":"Gelfond","year":"1991","journal-title":"New Gen. Comp."},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0485","doi-asserted-by":"crossref","DOI":"10.1007\/BF00962069","article-title":"Processing Negation and Disjunction in Logic Programs Through Integrity Constraints","volume":"2","author":"Gaasterland","year":"1993","journal-title":"Journal of Intelligent Information Systems"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0490","first-page":"323","article-title":"A Logic\u2013Based Approach to Data Integration","volume":"2","author":"Grant","year":"2002","journal-title":"TPLP"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0495","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1145\/321062.321073","article-title":"The Design and Simulation of an Information Processing System","volume":"8","author":"Gurk","year":"1961","journal-title":"JACM"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0500","series-title":"Logic and Data Bases","year":"1978"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0505","series-title":"Advances in Computing Research: The Theory of Databases","first-page":"247","article-title":"Answering Queries in indefinite Databases & the Null Value Problem","author":"Grant","year":"1986"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0510","series-title":"PKDD\u201990","first-page":"125","article-title":"Querying Inductive Databases via Logic\u2013Based User\u2013Defined Aggregates","author":"Giannotti","year":"1999"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0515","volume":"1","year":"1981"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0520","doi-asserted-by":"crossref","DOI":"10.1145\/356924.356929","article-title":"Logic and Databases: A Deductive Approach","volume":"16","author":"Gallaire","year":"1984","journal-title":"ACM Comp. Surveys"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0525","first-page":"3","article-title":"An Architecture for a Cooperative Database System","author":"Godfrey","year":"1994"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0530","first-page":"2","article-title":"Ontological Queries: Rewriting and, optimization","author":"Gottlob","year":"2011"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0535","first-page":"133","article-title":"The Extended Closed World Assumption and its Relationship to Parallel Circumscription","author":"Gelfond","year":"1986","journal-title":"PODS\u201986"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0540","first-page":"129","article-title":"Non\u2013Determinism in Deductive Databases","author":"Giannotti","year":"1991","journal-title":"DOOD\u201991"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0545","first-page":"15","article-title":"Semantics and Expressive Power of Nondeterministic Constructs in Deductive Databases","volume":"62","author":"Giannotti","year":"2001","journal-title":"JCSS"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_rf0550","first-page":"169","article-title":"Research in Intelligent Question Answering Systems","author":"Green","year":"1968"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0555","doi-asserted-by":"crossref","DOI":"10.1145\/800186.810578","article-title":"The Use of Theorem\u2013Proving Techniques in Question\u2013Answering Systems","author":"Green","year":"1968"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0560","first-page":"219","article-title":"Application of Theorem Proving to Problem Solving","author":"Green","year":"1969"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0565","first-page":"105","article-title":"Greedy by Choice","author":"Greco","year":"1992","journal-title":"PODS\u201992"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0570","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1111\/j.1467-8640.1989.tb00312.x","article-title":"Compiling General Linear Recursions by Variable Connection Graph Analysis","volume":"5","author":"Han","year":"1989","journal-title":"Computational Intell."},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0575","first-page":"367","article-title":"Review number 36, 671 of Logic and Data Bases","volume":"21","author":"Harel","year":"1980"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0580","first-page":"1","article-title":"Datalog Redux: Experience and Conjecture","author":"Hellerstein","year":"2010","journal-title":"PODS\u201910"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0585","first-page":"73","article-title":"Handling Redundancy in the Processing of Recursive Database Queries","author":"Han","year":"1987"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0590","first-page":"137","article-title":"Knowledge\u2013Based Query Processing","author":"Hammer","year":"1980","journal-title":"VLDB\u201980"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0595","first-page":"259","article-title":"Incomplete Deductive Databases","volume":"3","author":"Imielinski","year":"1991","journal-title":"AMAI"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0600","first-page":"51","article-title":"Complexity of Query processing in Databases with OR\u2013objects","author":"Imielinski","year":"1989"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0605","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1119439.1119440","article-title":"Unfolding Partiality and Disjunctions in Stable Model Semantics","volume":"7","author":"Janhunen","year":"2006","journal-title":"ACM Trans. Comput. Log."},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0610","first-page":"400","article-title":"Non\u2013Monotonic Reasoning in FLORID","author":"Kandzia","year":"1997"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0615","series-title":"Generalization of ZYT\u2013Linearizability for Bilinear Datalog Programs, Information and Computation 188","first-page":"77","author":"Kang","year":"2004"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0620","first-page":"510","article-title":"Quist: A System for Semantic Query Optimization in Relational Databases","author":"King","year":"1981","journal-title":"VLDB\u201981"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0625","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0004-3702(71)90012-9","article-title":"Linear Resolution with Selection Function","volume":"2","author":"Kowalski","year":"1971","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0630","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0004-3702(90)90101-5","article-title":"Nonmonotonic Reasoning, Preferential Models and Cumulative Logics","volume":"44","author":"Kraus","year":"1990","journal-title":"Journal of Artificial Intelligence"},{"issue":"4","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0635","doi-asserted-by":"crossref","first-page":"741","DOI":"10.1145\/210332.210335","article-title":"Foundations of Object\u2013Oriented and Frame\u2013Based Languages","volume":"42","author":"Kifer","year":"1995","journal-title":"JACM"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0640","first-page":"388","article-title":"ACLP: Flexible Solutions to Complex Problems","author":"Kakas","year":"1997"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0645","first-page":"569","article-title":"Predicate Logic as a Programming Language","volume":"4","author":"Kowalski","year":"1974","journal-title":"Proc. of IFIP"},{"issue":"162","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0650","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0743-1066(92)90041-Z","article-title":"Database Updates in the Event Calculus","volume":"12","author":"Kowalski","year":"1992","journal-title":"JLP"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0655","first-page":"125","article-title":"Why not Negation by Fixpoint?","volume":"43","author":"Kolaitis","year":"1991","journal-title":"JCSS"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0660","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF03037383","article-title":"A Logic\u2013Based Calculus of Events","volume":"4","author":"Kowalski","year":"1986","journal-title":"New Generation Computing"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0665","article-title":"Answering Questions by Computer: A Logical Study","author":"Kuhns","year":"1967"},{"issue":"11","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0670","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/1592761.1592785","article-title":"Declarative Networking","volume":"52","author":"Loo","year":"2009","journal-title":"CACM"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_rf0675","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-72200-7_1","article-title":"Logic Programming and Nonmonotonic Reasoning: From Theory to Systems and Applications","author":"Leone","year":"2007"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0680","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0004-3702(84)90009-2","article-title":"Foundations of a Functional Approach to Knowledge Representation","volume":"23","author":"Levesque","year":"1984","journal-title":"Artificial Intelligence"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0685","doi-asserted-by":"crossref","first-page":"715","DOI":"10.1145\/363790.363817","article-title":"A Computer System for Inference Execution and Data Retrieval","volume":"10","author":"Levien","year":"1967","journal-title":"CACM"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0690","article-title":"Relational Data File: Experience with a System for Propositional Data Storage and Inference Execution","author":"Levien","year":"1969"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0695","series-title":"Logic\u2013Based Techniques in Data Integration","first-page":"575","author":"Levy","year":"2000"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0700","first-page":"377","article-title":"Abstract Answer Set Solvers","author":"Lierler","year":"2008","journal-title":"ICLP\u201908, LNCS 5366"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0705","article-title":"Inventing Stable Models: A Personal Perspective","volume":"19","author":"Lifschitz","year":"2006","journal-title":"Association for Logic Programming"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0710","series-title":"Transactions and Change in Logic Databases","first-page":"69","article-title":"On Active Deductive Databases: The Statelog Approach","author":"Lausen","year":"1998"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0715","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","article-title":"Foundations of Logic Programming","author":"Lloyd","year":"1987"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0720","first-page":"346","article-title":"Cmodels\u20132: SAT\u2013based Answer Set Solver Enhanced to Non-tight Programs","author":"Lierler","year":"2004"},{"issue":"11","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0725","first-page":"715","volume":"10","author":"Levien","year":"1967","journal-title":"A Computer System for Inference Execution and Data Retrieval"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0730","series-title":"Foundations of Disjunctive Logic Programming","author":"Lobo","year":"1992"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0735","first-page":"157","article-title":"Getting to the Airport: The Oldest Planning Problem in AI","author":"Lifschitz","year":"2000"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0740","series-title":"Automated Theorem Proving: A Logical Basis","author":"Loveland","year":"1978"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0745","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/1149114.1149117","article-title":"The DLV System for Knowledge Representation and Reasoning","volume":"7","author":"Leone","year":"2006","journal-title":"ACM Transactions on Computational Logic"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0750","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0306-4379(92)90003-6","article-title":"The Safe Computation of the Well\u2013Founded Semantics for Logic Programming","volume":"17","author":"Leone","year":"1992","journal-title":"Information Systems"},{"issue":"1\u20133","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0755","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0743-1066(96)00121-5","article-title":"GOLOG: A Logic Programming Language for Dynamic Domains","volume":"31","author":"Levesque","year":"1997","journal-title":"JLP"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0760","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1006\/inco.1997.2630","article-title":"Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics and Computation","volume":"135","author":"Leone","year":"1997","journal-title":"Information and Computation"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0765","first-page":"163","article-title":"Semantic Query Optimization in Datalog Programs","author":"Levy","year":"1995"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0770","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0743-1066(85)90013-5","article-title":"A Basis for Deductive Database Systems","volume":"2","author":"Lloyd","year":"1985","journal-title":"JLP"},{"issue":"11","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0775","doi-asserted-by":"crossref","first-page":"1577","DOI":"10.1109\/TKDE.2010.111","article-title":"A Novel Combination of Answer Set Programming with Description Logics for the Semantic Web","volume":"22","author":"Lukasiewicz","year":"2010","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0780","first-page":"135","article-title":"Confluence Analysis for Distributed Programs: A Model-Theoretic Approach","author":"Marczak","year":"2012"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0785","first-page":"415","article-title":"Satchmo: A Theorem Prover Implemented in Prolog","author":"Manthey","year":"1988"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0790","doi-asserted-by":"crossref","DOI":"10.21236\/AD0785031","article-title":"Situations, Actions and Causal Laws","author":"McCarthy","year":"1963"},{"issue":"1,2","key":"10.1016\/B978-0-444-51624-4.50013-7_rf0795","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0004-3702(80)90011-9","article-title":"Circumscription \u2013A Form of Non\u2013Monotonic Reasoning","volume":"13","author":"McCarthy","year":"1980","journal-title":"Journal of, Artificial Intelligence"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0800","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/0004-3702(80)90012-0","article-title":"Non\u2013Monotonic Logic I","volume":"13","author":"McDermott","year":"1980","journal-title":"Journal of Artificial Intelligence"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0805","first-page":"203","author":"Milnikel","year":"1997"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0810","series-title":"Logic\u2013Based Artificial Intelligence","year":"2000"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0815","series-title":"Nonmonotonic Reasoning. Essays Celebrating its 30th Anniversary","first-page":"295","article-title":"Reminiscences on the Anniversary of 30 Years of Nonmonotonic Reasoning","author":"Minker","year":"2011"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0820","series-title":"Semantic Information Processing","year":"1968"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0825","first-page":"292","article-title":"On Indefinite Databases and the Closed World Assumption","author":"Minker","year":"1982"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0830","year":"1986"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0835","series-title":"Foundations of Deductive Databases and Logic Programming","year":"1988"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0840","first-page":"121","article-title":"Toward a Foundation of Disjunctive Logic Programming","author":"Minker","year":"1989"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0845","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0743-1066(93)90028-F","article-title":"An Overview of Nonmonotonic Reasoning and Logic Programming","volume":"17","author":"Minker","year":"1993","journal-title":"JLP"},{"issue":"1\u20132","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0850","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01530759","article-title":"Overview of Disjunctive Logic Programming","volume":"12","author":"Minker","year":"1994","journal-title":"Journal of Artificial Intelligence & Mathematics"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0855","series-title":"Logical Foundations for Cognitive Agents: Contributions in Honor of Ray Reiter","first-page":"234","article-title":"Logic and Databases: A 20 Year Retrospective \u2013 Updated in Honor of Ray Reiter","author":"Minker","year":"1999"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0860","first-page":"50","article-title":"The Use of a Semantic Network in Deductive Question-Answering Systems","author":"McSkimin","year":"1977"},{"issue":"4","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0865","first-page":"1","article-title":"On Recursive Axioms in Deductive Databases","volume":"7","author":"Minker","year":"1982","journal-title":"Information Systems"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0870","first-page":"396","article-title":"Possible\u2013World Semantics for Autoepistemic Logic","author":"Moore","year":"1984"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0875","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0004-3702(85)90042-6","article-title":"Semantical Considerations on Nonmonotonic Logic","volume":"25","author":"Moore","year":"1985","journal-title":"Journal of Artificial Intelligence"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0880","first-page":"264","article-title":"The Magic of Duplicates and Aggregates","author":"Mumick","year":"1990"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0885","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0743-1066(90)90033-2","article-title":"A Fixpoint Semantics for Disjunctive Logic Programs","volume":"9","author":"Minker","year":"1990","journal-title":"JLP"},{"issue":"3\/4","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0890","doi-asserted-by":"crossref","first-page":"145","DOI":"10.3233\/FI-1994-201236","article-title":"Semantics for Disjunctive Logic Programs with Explicit and Default Negation","volume":"20","author":"Minker","year":"1994","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0895","first-page":"472","article-title":"Disjunctive Logic Programming: A Survey and Assessment","volume":"Part I","author":"Minker","year":"2002"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0900","article-title":"Relational Data System Study","author":"Minker","year":"1970"},{"issue":"4\u20135","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0905","first-page":"609","article-title":"A Declarative Extension of Horn Clauses, and its Significance for Datalog and its Applications","volume":"13","author":"Mazuran","year":"2013","journal-title":"TPLP"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0910","doi-asserted-by":"crossref","first-page":"588","DOI":"10.1145\/116825.116836","article-title":"Autoepistemic Logic","volume":"38","author":"Marek","year":"1991","journal-title":"JACM"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_rf0915","series-title":"T he Logic Programming Paradigm","first-page":"375","article-title":"Stable Models and an Alternative Logic Programming Paradigm","author":"Marek","year":"1999"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0920","first-page":"554","article-title":"Design Overview of the Nail! System","author":"Morris","year":"1986"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0925","first-page":"340","article-title":"One\u2013Sided Recursions","author":"Naughton","year":"1987","journal-title":"PODS\u201987"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0930","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0022-0000(91)90011-S","article-title":"One\u2013Sided Recursions","volume":"42","author":"Naughton","year":"1991","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0935","series-title":"Answer Set Programming","article-title":"A Prolog Decision Support System for the Space Shuttle","author":"Nogueira","year":"2001"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0940","first-page":"33","article-title":"Data Base: Theory vs. Interpretation","author":"Nicolas","year":"1978"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0945","first-page":"227","article-title":"Logic for Improving Integrity Checking in Relational Databases","volume":"18","author":"Nicolas","year":"1979","journal-title":"Acta Informatica"},{"issue":"3\u20134","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0950","first-page":"241","article-title":"Logic Programs with Stable Model Semantics as a Constraint Programming Paradigm","volume":"25","author":"Niemel\u00e4","year":"1999","journal-title":"AMAI"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0955","series-title":"Extending the Smodels System with Cardinality and Weight Constraints","first-page":"491","author":"Niemel\u00e4","year":"2000"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0960","first-page":"595","article-title":"Natural Question Answering and Automatic Deduction in System Syntex","author":"Nicolas","year":"1974"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0965","first-page":"227","article-title":"A Decidable Class of Bounded Recursions","author":"Naughton","year":"1987"},{"issue":"3,4","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0970","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0743-1066(91)90037-P","article-title":"A Simple Characterization of Uniform Boundedness for a Class of Recursions","volume":"10","author":"Naughton","year":"1991","journal-title":"JLP"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0975","first-page":"420","article-title":"Smodels \u2013An Implementation of the Stable Model and Well-Founded Semantics for Normal Logic Programs","author":"Niemel\u00e4","year":"1997"},{"issue":"4","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0980","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1093\/logcom\/exn042","article-title":"OntoDLV: An ASP-Based System for Enterprise Ontologies","volume":"19","author":"Ricca","year":"2009","journal-title":"J. Log. Comput."},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50013-7_bb0985","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0304-3975(92)90013-6","article-title":"Testing Logic Programs for Local Stratification","volume":"103","author":"Palopoli","year":"1992","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0990","series-title":"Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference","author":"Pearl","year":"1988"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb0995","first-page":"52","article-title":"Sixty Years of Stable Models","author":"Pearce","year":"2008"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1000","series-title":"Barcel\u00f3 and Pichler","first-page":"27","article-title":"How (Well) do Datalog, Sparql and RIF Interplay?","author":"Polleres","year":"2012"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1005","first-page":"214","article-title":"Planning with Natural Actions in the Situation Calculus","author":"Pirri","year":"2000"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1010","first-page":"193","article-title":"On the Declarative Semantics of Deductive Databases and Logic Programming","author":"Przymusinski","year":"1988"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1015","first-page":"1081","article-title":"Perfect Model Semantics","author":"Przymusinski","year":"1988"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1020","first-page":"11","article-title":"Every Logic Program has a Natural Stratification and an Iterated Least Fixed Point Model","author":"Przymusinski","year":"1989"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1025","first-page":"40","article-title":"Stationary Semantics for Disjunctive Logic Programs and Deductive Databases","author":"Przymusinski","year":"1990"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1030","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/BF03037171","article-title":"Stable Semantics for Disjunctive Programs","volume":"9","author":"Przymusinski","year":"1991","journal-title":"New Generation Computing"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1035","first-page":"323","article-title":"Static Semantics for Normal and Disjunctive Logic Programs","author":"Przymusinski","year":"1995"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1040","series-title":"SIR: A Computer Program for Semantic Information Retrieval.","author":"Raphael","year":"1964"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_rf1040","series-title":"Semantic Information Processing","first-page":"33","article-title":"A Computer Program for Semantic Information Retrieval","author":"Raphael","year":"1968"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1050","series-title":"Knowledge In Action","author":"Reiter","year":"2001"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1055","first-page":"55","article-title":"On Closed World Data Bases","author":"Reiter","year":"1978"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1060","first-page":"149","article-title":"Deductive Question-Answering on Relational Data Bases","author":"Reiter","year":"1978"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1065","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","article-title":"A Logic for Default Reasoning","volume":"13","author":"Reiter","year":"1980","journal-title":"Journal of Artificial Intelligence"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1070","series-title":"On Conceptual Modelling","first-page":"163","article-title":"Towards A Logical Reconstruction of Relational Database Theory","author":"Reiter","year":"1984"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50013-7_bb1075","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1145\/5383.5388","article-title":"A Sound and Sometimes Complete Query Evaluation Algorithm for Relational Databases with Null Values","volume":"33","author":"Reiter","year":"1986","journal-title":"JACM"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1080","first-page":"97","article-title":"On Integrity Constraints","author":"Reiter","year":"1988"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50013-7_bb1085","first-page":"361","article-title":"Team-Building with Answer Set Programming in the Gioia-Tauro Seaport","volume":"12","author":"Ricca","year":"2012","journal-title":"TPLP"},{"issue":"1\u20134","key":"10.1016\/B978-0-444-51624-4.50013-7_bb1090","first-page":"339","article-title":"On Stratified Disjunctive Programs","volume":"1","author":"Rajasekar","year":"1990","journal-title":"AMAI"},{"issue":"3\u20134","key":"10.1016\/B978-0-444-51624-4.50013-7_bb1095","first-page":"333","article-title":"Logic Knowledge Bases with two Default Rules","volume":"22","author":"Ruiz","year":"1998","journal-title":"AMAI"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50013-7_bb1100","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A Machine-Oriented Logic Based on the Resolution Principle","volume":"12","author":"Robinson","year":"1965","journal-title":"JACM"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1105","first-page":"352","article-title":"Well\u2013Founded Semantics for Disjunctive Logic Programs","author":"Ross","year":"1989"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1110","first-page":"161","article-title":"Modular Stratification and Magic Sets for Datalog Programs with Negation","author":"Ross","year":"1990"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1115","first-page":"544","article-title":"The Coral Deductive Database System","author":"Ramakrishnan","year":"1993"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50013-7_bb1120","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1006\/jcss.1997.1453","article-title":"Monotonic Aggregation in Deductive Database","volume":"54","author":"Ross","year":"1997","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1125","first-page":"430","article-title":"XSB: A System for Efficiently Computing Well-Founded Semantics","author":"Rao","year":"1997"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50013-7_bb1130","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0743-1066(94)00039-9","article-title":"A Survey of Research on Deductive Database Systems","volume":"23","author":"Ramakrishnan","year":"1995","journal-title":"JLP"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1135","first-page":"49","article-title":"Differential Fixpoint Methods and Stratification of Logic Programs","author":"Sacc\u00e0","year":"1988"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50013-7_bb1140","first-page":"441","article-title":"The Expressive Power of Stable Models for Bound and Unbound Datalog Queries","volume":"54","author":"Sacc\u00e0","year":"1997","journal-title":"JCSS"},{"issue":"1\u20133","key":"10.1016\/B978-0-444-51624-4.50013-7_bb1145","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/S0743-1066(99)00073-4","article-title":"Abductive Logic Programming and Disjunctive Logic Programming: their Relationship and Transferability","volume":"44","author":"Sakama","year":"2000","journal-title":"JLP"},{"issue":"3\u20134","key":"10.1016\/B978-0-444-51624-4.50013-7_bb1150","first-page":"257","article-title":"Complexity and Undecideability Results for Logic Programming","volume":"15","author":"Schlipf","year":"1995","journal-title":"AMAI"},{"issue":"2\u20134","key":"10.1016\/B978-0-444-51624-4.50013-7_bb1155","first-page":"347","article-title":"Using Clausal Deductive Databases for Defining Semantics in Disjunctive Deductive Databases","volume":"33","author":"Seipel","year":"2001","journal-title":"AMAI"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1160","first-page":"291","article-title":"Decomposition of Linear Recursive Logic Programs","author":"Seipel","year":"1990"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_rf1160","first-page":"66","article-title":"Partial Evidential Stable Models for Disjunctive Deductive Databases","author":"Seipel","year":"1998"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1170","first-page":"1","article-title":"Solving the Frame Problem \u2013 A Mathematical Investigation of the Common Sense Law of Inertia","author":"Shanahan","year":"1997"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1175","first-page":"19","article-title":"Negation in Logic Programming","author":"Shepherdson","year":"1988"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1180","first-page":"435","article-title":"Cost\u2013Based Optimization for Magic: Algebra and Implementation","author":"Seshadri","year":"1996"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1185","first-page":"313","article-title":"A Theorem\u2013Proving Approach to Database Integrity","author":"Sadri","year":"1988"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50013-7_bb1190","first-page":"193","volume":"43","author":"Selman","year":"1996","journal-title":"Knowledge Compilation and Theory Approximation. JACM"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50013-7_bb1195","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/S0743-1066(96)00116-1","article-title":"Model Generation and State Generation for Disjunctive Logic Programs","volume":"32","author":"Seipel","year":"1997","journal-title":"JLP"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1200","first-page":"245","article-title":"A Characterization of Partial Stable Models for Disjunctive Deductive Databases","author":"Seipel","year":"1997"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1205","first-page":"600","volume":"62","author":"Smullyan","year":"1956","journal-title":"Bull, AMS"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1210","author":"Wikipedia"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1215","first-page":"355","article-title":"The Limits of Fixed-Order Computation","author":"Sagonas","year":"1996"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1220","first-page":"633","article-title":"An Abstract Machine for SLG Resolution: Definite Programs","author":"Swift","year":"1994"},{"issue":"3\u20134","key":"10.1016\/B978-0-444-51624-4.50013-7_bb1225","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1023\/A:1018990308362","article-title":"Tabling for Non\u2013Monotonic Programming","volume":"25","author":"Swift","year":"1999","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1230","first-page":"104","article-title":"Implementation of Recursive Queries for a Data Language Based on Pure Horn Logic","author":"Sacc\u00e0","year":"1987"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1235","first-page":"49","article-title":"Magic Counting Methods","author":"Sacc\u00e0","year":"1987"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1240","article-title":"LDL: A Logic\u2013Based Data\u2013Language","author":"Tsur","year":"1986"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1245","series-title":"Principles of Database Systems","author":"Ullman","year":"1990"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1250","first-page":"127","article-title":"Negation\u2013as\u2013Failure Using Tight Derivations for General Logic Programs","author":"Van Gelder","year":"1986"},{"issue":"1","key":"10.1016\/B978-0-444-51624-4.50013-7_bb1255","first-page":"185","article-title":"The Alternating Fixpoint of Logic Programs with Negation","volume":"47","author":"Van Gelder","year":"1993","journal-title":"JCSS"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1260","first-page":"137","article-title":"The Complexity of Relational Query languages","author":"Vardi","year":"1982"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1265","article-title":"EKS\u2013V1, A Short Overview","author":"Vieille","year":"1990"},{"issue":"4","key":"10.1016\/B978-0-444-51624-4.50013-7_bb1270","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1145\/321978.321991","article-title":"The Semantics of Predicate Logic as a Programming Language","volume":"23","author":"van Emden","year":"1976","journal-title":"JACM"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1275","first-page":"13","article-title":"Foundations of Aggregation in Deductive Databases","author":"Gelder","year":"1993"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50013-7_bb1280","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/116825.116838","article-title":"The Well\u2013Founded Semantics for General Logic Programs","volume":"38","author":"Van Gelder","year":"1991","journal-title":"JACM"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1285","article-title":"Recursive Axioms in Deductive Databases: The Query\/SubQuery Approach","author":"Vieille","year":"1986"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1290","first-page":"153","author":"Wittocx","year":"2008"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50013-7_rf1285","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0169-023X(00)00016-1","article-title":"Minimal Model Generation for Refined Answering of Generalized Queries in Disjunctive Deductive Databases","volume":"34","author":"Yahya","year":"2000","journal-title":"Journal of Data and Knowledge Engineering"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1300","first-page":"325","article-title":"Generalized Query Answering in Disjunctive Deductive Databases: Procedural and Nonmonotonic Aspects","author":"Yahya","year":"1997"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1305","first-page":"66","article-title":"A Sound and Complete Query Evaluation Algorithm for Relational Databases with Disjunctive, Information","author":"Yuan","year":"1989"},{"issue":"2","key":"10.1016\/B978-0-444-51624-4.50013-7_bb1310","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF00244994","article-title":"Deduction in non\u2013Horn Databases","volume":"1","author":"Yahya","year":"1985","journal-title":"JAR"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1315","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF00881833","article-title":"Autoepistemic Circumscription and Logic Programming","volume":"10","author":"Yuan","year":"1993","journal-title":"JAR"},{"issue":"1\u20133","key":"10.1016\/B978-0-444-51624-4.50013-7_bb1320","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/S0743-1066(99)00074-6","article-title":"An Abductive Approach to Disjunctive Logic Programming","volume":"44","author":"You","year":"2000","journal-title":"JLP"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1325","first-page":"142","article-title":"Database Relations with Null Values","volume":"28","author":"Zaniolo","year":"1984","journal-title":"JCSS"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1330","first-page":"204","article-title":"Negation and Aggregates in Recursive Rules: the LDL ++ Approach","author":"Zaniolo","year":"1993"},{"key":"10.1016\/B978-0-444-51624-4.50013-7_bb1335","first-page":"375","article-title":"The Deductive Database System LOLA","author":"Zukowski","year":"1997"},{"issue":"3","key":"10.1016\/B978-0-444-51624-4.50013-7_bb1340","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1145\/88636.89237","article-title":"A Necessary and Sufficient Condition to Linearize Doubly Recursive Programs in Logic Databases","volume":"15","author":"Zhang","year":"1990","journal-title":"ACM TODS"}],"container-title":["Handbook of the History of Logic","Computational Logic"],"original-title":[],"link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780444516244500137?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780444516244500137?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T18:43:27Z","timestamp":1598553807000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780444516244500137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"references-count":268,"URL":"https:\/\/doi.org\/10.1016\/b978-0-444-51624-4.50013-7","relation":{},"ISSN":["1874-5857"],"issn-type":[{"value":"1874-5857","type":"print"}],"subject":[],"published":{"date-parts":[[2014]]}}}