13 Hits in 5.6 sec

Computing only minimal answers in disjunctive deductive databases [article]

C. A. Johnson
2003 arXiv   pre-print
A method is presented for computing minimal answers in disjunctive deductive databases under the disjunctive stable model semantics.  ...  For stratified databases, the method does not (necessarily) require the computation of models of the database in their entirety.  ...  In [Jo98, Jo98a] , we presented a top-down query processing method applicable to first order (stratified) databases. Suppose for example that we have a unary predicate Q, then the query ?  ... 
arXiv:cs/0305007v1 fatcat:f3axevkwm5gp3jnbk3hep7z4iu

Optimization of Bound Disjunctive Queries with Constraints [article]

G. Greco, S. Greco, I. Trubtsyna, E. Zumpano
2004 arXiv   pre-print
"To Appear in Theory and Practice of Logic Programming (TPLP)" This paper presents a technique for the optimization of bound queries over disjunctive deductive databases with constraints.  ...  The motivation of this work stems from the observation that traditional binding propagation optimization techniques for bottom-up model generator systems, simulating the goal driven evaluation of top-down  ...  The authors thank Nicola Leone and Wolfgang Faber for useful suggestions.  ... 
arXiv:cs/0406013v1 fatcat:3mrh544psjdg7kd32c3soteq3a

Logic and Databases: Past, Present, and Future

Jack Minker
1997 The AI Magazine  
I review developments in the field, assess contributions, consider the status of implementations of deductive databases, and discuss future work needed in deductive databases. Articles  ...  Gallaire, Minker, and Nicolas stated that logic and databases was a field in its own right. This was the first time that this designation was made.  ...  The full paper is dedicated in honor of Hervé Gallaire and Jean-Marie Nicolas with whom I have worked as co-author, co-editor, colleague, and friend and who have helped to make the field of deductive databases  ... 
doi:10.1609/aimag.v18i3.1304 dblp:journals/aim/Minker97 fatcat:6foa4j2a45cabojbsyxj7rwpfq

A Disjunctive Semantics Based on Unfolding and Bottom-Up Evaluation [chapter]

Stefan Brass, Jürgen Dix
1994 Innovationen bei Rechen- und Kommunikationssystemen  
in order to eliminate the conditions where possible.  ...  It is an extension of both the well-founded semantics WFS and the generalized closed world semantics GCWA. We then present a bottom-up query-evaluation method for this semantics.  ...  There are also a number of top-down query evaluation algorithms for the well-founded semantics without disjunctions, e.g. [CW93b] .  ... 
doi:10.1007/978-3-642-51136-3_13 dblp:conf/gi/BrassD94 fatcat:ygzuf56o3fa6rdnxyy2egsvppq

An overview of nonmonotonic reasoning and logic programming

Jack Minker
1993 The Journal of Logic Programming  
In the case of deductive databases, they develop algorithms to operate over the model tree of the disjunctive theory so as to answer queries in the stable model semantics.  ...  For any set of first-order sentences S, define I(S) to be the smallest set satisfying the following three properties: 1. WCIW. I(S) is closed under first-order logical consequence. 3.  ... 
doi:10.1016/0743-1066(93)90028-f fatcat:zs5h4ximffdfvapevyr6rvs4fm

Knowledge representation with logic programs [chapter]

Gerhard Brewka, Jürgen Dix
1998 Lecture Notes in Computer Science  
In this tutorial-overview, which resulted from a lecture course given by the authors at the European Summer School in Logic, Language and Information 1997 in Aix-en-Provence (  ...  Katrin Erk and Dorothea Schäfer proofread parts of the paper-special thanks to them.  ...  top-down approach and a bottom-up evaluation.  ... 
doi:10.1007/bfb0054788 fatcat:5fa5wrvqgnco5kdgef2zcsrysm

Logic programming and negation: A survey

Krzysztof R. Apt, Roland N. Bol
1994 The Journal of Logic Programming  
Deductive databases form an extension of relational databases in which some of the relations are implicitly defined.  ...  of the problem in first-order logic.  ... 
doi:10.1016/0743-1066(94)90024-8 fatcat:krg2a4l2zbdqlftzysdsszfj64

Designing a Framework for Exchanging Partial Sets of BIM Information on a Cloud-Based Service

Alan Redmond, Roger West, Alan Hore
2013 InternaInternational Journal of 3-D Information Modeling  
In order, to accomplish a database query a Structured Query Language (SQL) (a database programming language for querying and editing information) filter may be used in a database workshop linking the results  ...  However, in order to obtain full interoperability between the applications, a flat structured (relational database) XML would benefit the process.  ... 
doi:10.4018/ij3dim.2013100102 fatcat:elyjbrh3h5gytlvhftm7wuwmk4

Description of CS value chains

John R. Isaksen, Andy Thorpe, Pierre Failler, Grégoire Touron-Gardic, Cornet Cornet, Øystein Hermansen, Thong Nguyen, Olavur Gregerson, Marianne Svorken
2019 Zenodo  
The available data from within the value chains from processing to consumption does vary considerably as well.  ...  One major challenge in this work has been the lack of reliable data, which in fact is a general challenge for these fisheries.  ...  in the Japanese (down from 77 vessels to just 2) and Taiwanese fleets (down from 178 to 85).  ... 
doi:10.5281/zenodo.3074057 fatcat:mcljjp2lpzhr3id6rwkdpz4ey4

Knowledge Representation with Logic Programs [chapter]

Gerhard Brewka, Jürgen Dix
Handbook of Philosophical Logic  
In this tutorial-overview, which resulted from a lecture course given by the authors at the European Summer School in Logic, Language and Information 1997 in Aix-en-Provence (  ...  Katrin Erk and Dorothea Schäfer proofread parts of the paper-special thanks to them.  ...  top-down approach and a bottom-up evaluation.  ... 
doi:10.1007/1-4020-3092-4_1 fatcat:fa4pkofj7fcgxgx4timys4grda

Personalized City Tours - An Extension of the OGC OpenLocation Specification

Matthias Michael Jöst
Die Arbeit wurde bisher weder im In-noch im Ausland in gleicher oder ähnlicher Form in anderen Prüufungsverfahren vorgelegt.  ...  words taking a bottom up or top-down approach.  ...  At first it queries an OpenLS Directory Service in order to obtain all POIs given the graph extent.  ... 
doi:10.11588/heidok.00009768 fatcat:gyam6em275c45f6cvsmt6vybfe

Pre-Proceedings of the International Colloquium on Graph and Model Transformation – On the occasion of the 65th birthday of Hartmut Ehrig (GraMoT 2010) [article]

(:Unkn) Unknown, Technische Universität Berlin, Technische Universität Berlin, Claudia Ermel, Hartmut Ehrig, Fernando Orejas, Gabriele Taentzer
The goal of the colloquium is to foster interaction between the graph transformation and the model transformation community in order to facilitate exchange of results and challenging problems.  ...  Moreover we are looking forward to the special issue of ECEASST, whereafter the review process -the final versions of the accepted contributions will be published.  ...  Acknowledgements: We want to thank Fabio Gadducci, Alberto Lluch Lafuente, Daniele Terreni and Liang Zhao for many interesting discussions and exchange of ideas regarding the graphical encoding of CaSPiS  ... 
doi:10.14279/depositonce-10237 fatcat:44oa7p3275fhpdl4k5kdjr7euy


Timothy Lenoir, Hans Gumbrecht, Friedrich Kittler, Geoffrey Wint, Hrop-Young And, Michael Wutz
Although the arts have processed the orders of the symbolic or the orders of things, film presents its spec tators with their own processes of perception-and with a precision that is otherwise accessible  ...  "The well-known philosopher and writer" shed his first attribute in order to merge with his second.  ...