Filters








792 Hits in 4.9 sec

Logic Programming in DataLog: A Long Tour from Theory to Practice

Sergio Greco, Luigi Palopoli, Nicola Leone, Pasquale Rullo, Domenico Saccà
2008 Festschrifts: Birthday, In Memory of ...  
Van Gelder and others proposed a solution to the problem of providing a clean semantics to programs with recursive negation, by defining the concept of well-founded model.  ...  The semantics of (disjunctive) logic programs with preferences on atoms was later investigated in [Greco(136) ]. But we also investigated the semantics of negation in DATALOG-like languages.  ... 
dblp:conf/birthday/GrecoPLRS08 fatcat:ps5o6yg4ffcapnx3i5xfjjrpve

Extended Magic for Negation: Efficient Demand-Driven Evaluation of Stratified Datalog with Precise Complexity Guarantees

K. Tuncay Tekle, Yanhong A. Liu
2019 Electronic Proceedings in Theoretical Computer Science  
to an optimal bottom-up evaluation method for Datalog with stratified negation, to handle non-stratified negation in the resulting rules.  ...  However, when Datalog is extended with even stratified negation, which has a simple and universally accepted semantics, transformations to make rules demand-driven may result in non-stratified negation  ...  This semantics coincides with all well-known semantics for negation, including perfect model semantics [22] , well-founded semantics [13] , and stable model semantics [14] .  ... 
doi:10.4204/eptcs.306.28 fatcat:qmt3s2tf7bc3tmhdhjxb5vhfsm

Hypothesis Support for Information Integration in Four-Valued Logics [chapter]

Yann Loyer, Nicolas Spyratos, Daniel Stamate
2000 Lecture Notes in Computer Science  
We also establish an intuitively appealing connection between our hypothesis testing mechanism on the one hand, and the well-founded semantics and Kripke-Kleene semantics of Datalog programs with negation  ...  In this framework we work with the class of programs defined by Fitting and we develop a theory for information integration.  ...  We also show that there is an interesting connection between hypothesis based semantics and the semantics of Datalog programs with negation.  ... 
doi:10.1007/3-540-44929-9_37 fatcat:24htsmdsmbf3leij33oqfzcrqa

A paraconsistent logic programming approach for querying inconsistent databases

Sandra de Amo, Mônica Sakuray Pais
2007 International Journal of Approximate Reasoning  
We also present a bottomup evaluation method for P-Datalog programs based on an alternating fixpoint operator.  ...  In this paper, we use a paraconsistent logic (LFI1) as the underlying logic for the specification of P-Datalog, a deductive query language for databases containing inconsistent information.  ...  semantics for P-Datalog programs.  ... 
doi:10.1016/j.ijar.2006.09.009 fatcat:tezgi5pygfeldi4klw5nauivy4

Enhancing the expressive power of the U-Datalog language [article]

Elisa Bertino, Barbara Catania, Roberta Gori
2004 arXiv   pre-print
In this paper, we provide a semantics, based on stratification, handling the use of negated atoms in U-Datalog programs, and we show which problems arise in defining a compositional semantics.  ...  A U-Datalog program can be interpreted as a CLP program.  ...  semantics for a stratified U-Datalog ¬ program corresponds to an unfolding semantics computed in two steps: 1.  ... 
arXiv:cs/0404003v1 fatcat:yqp7aimjmzb7ziptj35yp7cuna

Generative Datalog with Stable Negation [article]

Mario Alviano, Matthias Lanzinger, Michael Morak, Andreas Pieris
2022 arXiv   pre-print
In particular, the challenging question is how the probabilistic semantics of generative Datalog with negation can be robustly defined.  ...  A natural question to ask is how generative Datalog can be enriched with the useful feature of negation, which in turn leads to a strictly more expressive declarative probabilistic programming language  ...  In Section 3, we introduce a formal semantics for generative Datalog with stable negation.  ... 
arXiv:2206.12247v1 fatcat:5bau47m545aqdakojpekgrw3oa

Building Rules on Top of Ontologies for the Semantic Web with Inductive Logic Programming

FRANCESCA A. LISI
2008 Theory and Practice of Logic Programming  
In this paper, we consider the problem of automating the acquisition of these rules for the Semantic Web.  ...  We propose a general framework for rule induction that adopts the methodological apparatus of Inductive Logic Programming and relies on the expressive and deductive power of$\mathcal{AL}$-log.  ...  The model-theoretic semantics of Datalog is based on the notion of Herbrand interpretation. Let D be a Datalog program.  ... 
doi:10.1017/s1471068407003195 fatcat:2ncsy2pl35holhip7j5xdtgcam

Hypotheses Founded Semantics of Logic Programs for Information Integration in Multi-Valued Logics [article]

Yann Loyer, Nicolas Spyratos, Daniel Stamate
2001 arXiv   pre-print
We also establish an intuitively appealing connection between our hypothesis testing mechanism on the one hand, and the well-founded semantics and Kripke-Kleene semantics of Datalog programs with negation  ...  In this framework we work with the class of programs defined by Fitting and we develop a theory for information integration.  ...  We also show that there is an interesting connection between hypothesis based semantics and the semantics of Datalog programs with negation.  ... 
arXiv:cs/0111059v1 fatcat:2ji3ownw3fbrbcdrvx655r7nsi

A closer look at the semantic relationship between Datalog and description logics

Markus Krötzsch, Sebastian Rudolph, Peter H. Schmitt
2015 Semantic Web Journal  
Translations to (first-order) Datalog have been used in a number of inferencing techniques for description logics (DLs), yet the relationship between the semantic expressivities of function-free Horn logic  ...  In this work, we offer a characterisation for DL fragments that can be expressed, in a concrete sense, in Datalog.  ...  A second defining property of DLP is the semantic correspondence with some Datalog program.  ... 
doi:10.3233/sw-130126 fatcat:fhtmjirfyfejhhiaocjmpmax3q

Nondeterminism through well-founded choice

Weidong Chen, Jinghong Zeng
1996 The Journal of Logic Programming  
It generalizes the stable model semantics of Datalog with choice to logic programs with negation, and yet avoids the problem of NPcompleteness of the existence of stable models in general.  ...  t> This paper introduces nondeterminism into logic programs with negation by associating functional dependencies with some predicates, and develops the well-founded choice semantics.  ...  For function-free programs without negation, it extends the model-theoretic choice, or the stable model semantics of Datalog program with choice by Sacc~t and Zaniolo [22].  ... 
doi:10.1016/0743-1066(95)00091-7 fatcat:bdopesvz4bdszmd5wymeeh3hqq

Inf-datalog, Modal Logic and Complexities

Eugénie Foustoucos, Irène Guessarian
2007 RAIRO - Theoretical Informatics and Applications  
Inf-Datalog extends the usual least fixpoint semantics of Datalog with greatest fixpoint semantics: we defined inf-Datalog and characterized the expressive power of various fragments of inf-Datalog in  ...  in space for CT L and alternation-free modal µ-calculus, and 2. linear-space (data and program) complexities, linear-time program complexity and polynomial-time data complexity for Lµ k (modal µ-calculus  ...  In [16] we introduced the language inf-Datalog, which extends usual least fixpoint semantics of Datalog with greatest fixpoint semantics: greatest fixpoints are necessary for expressing properties such  ... 
doi:10.1051/ita:2007043 fatcat:4lvx2m6mafbfbke2nf5hwq3pdm

Extending stratified datalog to capture complexity classes ranging from ${\cal P} to {\cal QH}$

Sergio Greco, Domenico Saccà, Carlo Zaniolo
2001 Acta Informatica  
The solution is based on (i) stratified negation as the core of a simple, declarative semantics for negation, (ii) the use of a "choice" construct to capture the nondeterminism of stable models in a disciplined  ...  This paper presents a unified solution to the problem of extending stratified DATALOG to express database complexity classes ranging from P to QH; QH is the query hierarchy containing the decision problems  ...  The usage of unrestricted negation in programs is often neither simple nor intuitive, and, for example, might lead to writing programs that have no total stable models (the same problem as for well-founded  ... 
doi:10.1007/pl00013306 fatcat:44olmfk7srfnrkwis3yvhxanka

Win-move is coordination-free (sometimes)

Daniel Zinn, Todd J. Green, Bertram Ludäscher
2012 Proceedings of the 15th International Conference on Database Theory - ICDT '12  
We show the surprising result that the query given by the well-founded semantics of the unstratifiable win-move program is coordination-free in some of the models we consider.  ...  In a recent paper by Hellerstein [15], a tight relationship was conjectured between the number of strata of a Datalog^ program and the number of "coordination stages" required for its distributed computation  ...  Datalog ¬ programs P ; and in these cases, the well-founded model agrees with stratified model.  ... 
doi:10.1145/2274576.2274588 dblp:conf/icdt/ZinnGL12 fatcat:dtdthuubtjbjhmuel7limzjjua

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).  ...  not only the structure but also the semantics of data in an explicit way, thus enabling complex inference procedures.  ...  Dahl for her insights on Datalog applications for Natural Language Processing and to B. Motik for his presentation on Datalog-based formalisms in the Semantic-Web community.  ... 
doi:10.1017/s1471068410000086 fatcat:2zi7w5eejvanpknuncdy6qmw2e

Games and total Datalog¬ queries

Jörg Flum, Max Kubierschky, Bertram Ludäscher
2000 Theoretical Computer Science  
We show that the expressive power of Datalog @ programs under the well-founded semantics does not decrease when restricted to total programs thereby a rmatively answering an open question posed by Abiteboul  ...  Also, for the nonin ationary semantics we derive a new normal form whose only recursive rule simulates a version of the game of life.  ...  For the NI-semantics and the WF-semantics, we show that • every Datalog ¬ program is equivalent to a total one, and • for every Datalog ¬ program there is another program having as truth set the false  ... 
doi:10.1016/s0304-3975(99)00222-4 fatcat:fwza5tbatzg7vpsv6bfgokqstu
« Previous Showing results 1 — 15 out of 792 results