Filters








319,370 Hits in 3.3 sec

General logical databases and programs: Default logic semantics and stratification

Nicole Bidoit, Christine Froidevaux
1991 Information and Computation  
After presenting, in general, how to use default logic in order to define the meaning of logical databases and logic programs, the class of stratitiable databases and programs is extensively studied in  ...  Default logic is introduced as a well-suited formalism for defining the declarative semantics of deductive databases and logic programs.  ...  and logic programs.  ... 
doi:10.1016/0890-5401(91)90073-b fatcat:xmez4y73nnbmpk3hzv7izerzpm

Database query languages and functional logic programming

Jesús M. Almendros-Jiménez, Antonio Becerra-Terón
2006 New generation computing  
Functional logic programming is a paradigm which integrates functional and logic programming. It is based on the use of rewriting rules for defining programs, and rewriting for goal solving.  ...  To use functional logic programming as a database programming language, (1) we will propose a data model involving the main features adopted from functional logic programming (for instance, handling of  ...  Contributions of the Paper In order to integrate functional logic programming and databases, we propose: (1) to adapt functional logic programs to databases, by considering a suitable data model and  ... 
doi:10.1007/bf03037296 fatcat:nrklsenccja7pajdh25aitveam

Inductive Logic Programming in Databases: From Datalog to

FRANCESCA A. LISI
2010 Theory and Practice of Logic Programming  
In particular, we investigate this issue from the ILP perspective by considering two database problems, (i) the definition of views and (ii) the definition of constraints, for a database whose schema is  ...  AbstractIn this paper we address an issue that has been brought to the attention of the database community with the advent of the Semantic Web, i.e., the issue of how ontologies (and semantics conveyed  ...  Acknowledgements We are grateful to Riccardo Rosati for his precious advice on DL+log ¬∨ and Diego Calvanese for his valid support on the Boolean CQ/UCQ containment problem.  ... 
doi:10.1017/s1471068410000116 fatcat:fhmx2lyy4vb4dfqk6hayrfi4o4

Classical negation in logic programs and disjunctive databases

Michael Gelfond, Vladimir Lifschitz
1991 New generation computing  
We show that some facts of commonsense knowledge can be represented by logic programs and disjunctive databases more easily when classical negation is available.  ...  An important limitation of traditional logic programming as a knowledge representation tool, in comparison with classical logic, is that logic programming does not allow us to deal directly with incomplete  ...  This research was supported in part by NSF grants IRI-8906516 and IRI-8904611 and by DARPA under Contract N00039-84-C-0211. Notes  ... 
doi:10.1007/bf03037169 fatcat:5y3cb7m5vvbszcvmcijteunjue

Minimal founded semantics for disjunctive logic programs and deductive databases

FILIPPO FURFARO, GIANLUIGI GRECO, SERGIO GRECO
2004 Theory and Practice of Logic Programming  
In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases.  ...  We study the expressive power of the semantics and show that for general disjunctive datalog programs it has the same power as disjunctive stable model semantics.  ...  The authors are grateful to the anonymous referees for their useful comments and suggestions.  ... 
doi:10.1017/s1471068403001704 fatcat:33xpkgsxwzayda3xxs7t3e7jmq

A Theorem-Proving Approach to Database Integrity [chapter]

Fariba Sadri, Robert Kowalski
1988 Foundations of Deductive Databases and Logic Programming  
The Consistency method is suitable for general range-restricted deductive databases where the constraints can be arbitrary formulae of first order predicate logic, and the transactions consist of one or  ...  The method approximates the algorithms of Decker, Lloyd, Topor, et al, Martens and Bruynooghe, and Bry et al, which are the major existing algorithms for checking integrity of deductive databases. 3 ACKNOWLEDGEMENTS  ...  These assertions are generated automatically by another Prolog program, given the two databases and the constraints.  ... 
doi:10.1016/b978-0-934613-40-8.50013-0 fatcat:ul63p5fu3fbv5b4hjcim5kbl3q

A Superjoin Algorithm for Deductive Databases [chapter]

James A. Thom, Kotagiri Ramamohanarao, Lee Naish
1988 Foundations of Deductive Databases and Logic Programming  
This paper describes a join algorithm suitable for deductive and relational databases which are accessed by computers with large main memories.  ...  Using multi-key hashing and appropriate buffering, joins can be performed on very large relations more eficiently than with existing methods.  ...  SUPERJOIN AND DEDUCTIVE DATABASES We now show how the super-join algorithm is ideally suited to Prolog-style deductive databases.  ... 
doi:10.1016/b978-0-934613-40-8.50017-8 fatcat:xoa5midqdbdxvovgwynoj2dkja

Unification Revisited [chapter]

J-L. Lassez, M.J. Maher, K. Marriott
1988 Foundations of Deductive Databases and Logic Programming  
camp because of its bias to logic programming.  ...  Those who were expecting a more careful treatment of the semantics of logic programming than is provided by Lloyd will have to wait for the reportedly forthcoming book by Lassez and Maher.  ...  camp because of its bias to logic programming.  ... 
doi:10.1016/b978-0-934613-40-8.50019-1 fatcat:txzrfberlvgclf5tc2m3jftike

Minimal founded semantics for disjunctive logic programs and deductive databases [article]

Filippo Furfaro, Gianluigi Greco, Sergio Greco
2003 arXiv   pre-print
In this paper, we propose a variant of stable model semantics for disjunctive logic programming and deductive databases.  ...  We study the expressive power of the semantics and show that for general disjunctive datalog programs it has the same power as disjunctive stable model semantics.  ...  Acknowledgement The authors are grateful to the anonymous referees for their useful comments and suggestions.  ... 
arXiv:cs/0312028v1 fatcat:p4kxhotepzd2zhcj6ysycrnrha

A functional logic database library

Sebastian Fischer
2005 Proceedings of the 2005 ACM SIGPLAN workshop on Curry and functional logic programming - WCFLP '05  
Our library supports functional logic programming with databases in the background, i.e., the programmer can access a database without storage specific code employing functional logic programming techniques  ...  We describe a functional logic database library, based on persistent predicates, for Curry.  ...  From the logic programming point of view, a database table can be seen as specification of a predicate, storing the predicate's facts in its rows.  ... 
doi:10.1145/1085099.1085110 dblp:conf/wcflp/Fischer05 fatcat:cxs6sndne5eeheqxe3qh5wddja

Introduction to the TPLP special issue, logic programming in databases: From Datalog to semantic-web rules

GIORGIO ORSI, LETIZIA TANCA
2010 Theory and Practice of Logic Programming  
Logic has been a common ground where Database and Artificial Intelligence research competed and collaborated with each other for a long time (Abiteboulet al. 1995).  ...  Much has happened in data and knowledge base research since the introduction of the relational model in Codd (1970) and its strong logical foundations influence its advances ever since.  ...  its extensions, along with many related implementations and applications.  ... 
doi:10.1017/s1471068410000086 fatcat:2zi7w5eejvanpknuncdy6qmw2e

Experimenting with recursive queries in database and logic programming systems [article]

Giorgio Terracina, Nicola Leone, Vincenzino Lio, Claudio Panetta
2007 arXiv   pre-print
DLV^DB significantly outperforms even the commercial Database Systems on recursive queries. To appear in Theory and Practice of Logic Programming (TPLP)  ...  Moreover, the paper reports the results of a thorough experimental analysis we have carried out for comparing our system with several state-of-the-art systems (both logic and databases) on some classical  ...  This work has been partially supported by the italian "Ministero delle Attività Produttive" under project "Discovery Farm" B01/0297/P 42749-13, and by M.I.U.R. under project "ONTO-DLV: Un ambiente basato  ... 
arXiv:0704.3157v1 fatcat:og4ztqf7zfhsddlmm3o66z4uzq

Negation and minimality in disjunctive databases

Marco Schaerf
1995 The Journal of Logic Programming  
In this work, we generalize the semantics for negation in logic programs, putting together the constructive nature of the rule-based deductive databases with the syntaxindependence of the closed-world  ...  The first one is based on considering the set of rules composing the programs as inference rules and interpreting the negation in the body as failure to prove.  ...  Definition 3. 2 . 2 Let P1 and P2 be two logic programs.  ... 
doi:10.1016/0743-1066(94)00026-3 fatcat:yegnmn66hnertdkdw2a2alihua

On derived dependencies and connected databases

Philip W. Dart
1991 The Journal of Logic Programming  
The automatic generation of modes for PROLOG predicates [15] and logic programs [6,7,27] has been discussed elsewhere.  ...  These restrictions are severe, since they exclude predicates commonly used in logic programming for such fundamental tasks as list manipulation and arithmetic.  ... 
doi:10.1016/0743-1066(91)90017-j fatcat:oows44dlfnartg6tjb6uijmnqa

A three-valued semantics for deductive databases and logic programs

Jia-Huai You, Li Yan Yuan
1994 Journal of computer and system sciences (Print)  
We show that these two principles yield a declarative semantics for deductive databases and logic programs, which is called the regular model semantics.  ...  This paper proposes two principles, justifiability and minimal undefinedness, for a threevalued model-theoretic approach to semantics of logic programs and deductive databases (also called disjunctive  ...  We therefore assume ground deductive databases and logic programs if not otherwise said.  ... 
doi:10.1016/s0022-0000(05)80053-4 fatcat:bcm3dpz73naqrd3324wznayro4
« Previous Showing results 1 — 15 out of 319,370 results