Filters








1,240 Hits in 4.1 sec

On Acyclic and Head-Cycle Free Nested Logic Programs [chapter]

Thomas Linke, Hans Tompits, Stefan Woltran
2004 Lecture Notes in Computer Science  
We define the class of head-cycle free nested logic programs, and its proper subclass of acyclic nested programs, generalising similar classes originally defined for disjunctive logic programs.  ...  We further show that, based on a shifting method, head-cycle free nested programs can be rewritten into normal programs in polynomial time and space, extending a similar technique for head-cycle free disjunctive  ...  generalised to head-cycle free nested logic programs.  ... 
doi:10.1007/978-3-540-27775-0_16 fatcat:4k7pjlfpyngblpm6z2iuxrbwqy

On the Termination of Logic Programs with Function Symbols

Sergio Greco, Francesca Spezzano, Irina Trubitsyna, Marc Herbstritt
2012 International Conference on Logic Programming  
This paper introduces, by deeply analyzing program structure, new decidable criteria, called safety and Γ-acyclicity, for checking termination of logic programs with function symbols under bottom-up evaluation  ...  We compare new criteria with other decidable criteria known in the literature and show that the Γ-acyclicity criterion is the most general one.  ...  The class of Γ-acyclic programs is defined by only considering affected arguments and cycles spelling strings of an underlying context free language.  ... 
doi:10.4230/lipics.iclp.2012.323 dblp:conf/iclp/GrecoST12 fatcat:inizprimargyjc4uvd7juiydmy

Effectively-Propositional Reasoning about Reachability in Linked Data Structures [chapter]

Shachar Itzhaky, Anindya Banerjee, Neil Immerman, Aleksandar Nanevski, Mooly Sagiv
2013 Lecture Notes in Computer Science  
Our result is based on the following ideas: (1) Programmers must write assertions in a restricted logic without quantifier alternation or function symbols. (2) The correctness of many programs can be expressed  ...  lists and that is annotated with assertions written in this restricted logic, can be verified with a SAT solver.  ...  the heads of lists, and any two lists have at most one cutpoint.  ... 
doi:10.1007/978-3-642-39799-8_53 fatcat:ltfnbbpqojhmdl5keahlc762py

Checking termination of bottom-up evaluation of logic programs with function symbols

MARCO CALAUTTI, SERGIO GRECO, FRANCESCA SPEZZANO, IRINA TRUBITSYNA
2014 Theory and Practice of Logic Programming  
AbstractRecently, there has been an increasing interest in the bottom-up evaluation of the semantics of logic programs with complex terms.  ...  The paper introduces new decidable criteria for checking termination of logic programs with function symbols under bottom-up evaluation, by deeply analyzing the program structure.  ...  Acknowledgements 1199 The authors would like to thank the anonymous reviewers for their valuable 1200 comments and suggestions. 1201  ... 
doi:10.1017/s1471068414000623 fatcat:yloa3b7nvnfgjfwuvn74jrn4zi

Verifying properties of well-founded linked lists

Shuvendu K. Lahiri, Shaz Qadeer
2006 SIGPLAN notices  
at least one head cell.  ...  We have implemented our method in a tool and used it to verify the correctness of a variety of nontrivial programs manipulating both acyclic and cyclic singly-linked lists and doubly-linked lists.  ...  Acknowledgements We are grateful to Venkatesan Guruswami for his help in proving Lemma 1 and to Thomas Ball for his insightful comments on this paper.  ... 
doi:10.1145/1111320.1111048 fatcat:gcmimmuwvnfjhdrz6w5cvcg4ue

J-Logic: a Logic for Querying JSON [article]

Jan Hidders and Jan Paredaens and Jan Van den Bussche
2020 arXiv   pre-print
Paths are sequences of keys and are used to access the tree structure of nested JSON objects. J-Logic also features "packing" as a means to generate a new key from a path or subpath.  ...  We propose a logical framework, based on Datalog, to study the foundations of querying JSON data. The main feature of our approach, which we call J-Logic, is the emphasis on paths.  ...  Acknowledgment We thank Dominik Freydenberger and Georg Gottlob for helpful communications.  ... 
arXiv:2006.04277v1 fatcat:dtfigloygbeklb3rfi23bcucc4

Reasoning with infinite stable models

Piero A. Bonatti
2004 Artificial Intelligence  
They are a class of normal logic programs whose consequences under the stable model semantics can be effectively computed, despite the fact that finitary programs admit function symbols (hence infinite  ...  This paper illustrates extensively the theoretical properties, the implementation issues, and the programming style underlying finitary programs.  ...  Acknowledgements The author is grateful to the anonymous referees of this paper and its preliminary versions for their deep and careful reviews, and for their precious suggestions.  ... 
doi:10.1016/j.artint.2004.02.001 fatcat:sfccg7lmfbaqzkvtt4eerkcsdi

Implementation and Performance of Probabilistic Inference Pipelines [chapter]

Dimitar Shterionov, Gerda Janssens
2015 Lecture Notes in Computer Science  
Our main contributions are the thorough analysis of ProbLog inference pipelines and the introduction of new pipelines, one of which performs very well on our benchmarks.  ...  In order to handle real-world problems, state-of-the-art probabilistic logic and learning frameworks, such as ProbLog, reduce the expensive inference to an efficient Weighted Model Counting.  ...  Background The Probabilistic Logic and Learning Language ProbLog ProbLog [7, 12] is a general purpose Probabilistic Logic and Learning (PLL) programming language.  ... 
doi:10.1007/978-3-319-19686-2_7 fatcat:jt7pohps45hojo6yv2fu7sjwwq

Query Answering in Resource-Based Answer Set Semantics [article]

Stefania Costantini, Andrea Formisano
2016 arXiv   pre-print
In this paper, we propose a query-answering procedure reminiscent of Prolog for answer set programs under this extended semantics as an extension of XSB-resolution for logic programs with negation.  ...  In fact, the name of the new semantics comes from the fact that in the linear-logic formulation every literal (including negative ones) were considered as a resource.  ...  A program Π in which there is no head A such that A ∈ dependencies of (A) is called acyclic.  ... 
arXiv:1608.01604v1 fatcat:nxksxko4svcuhkgtzdmoo3tyou

Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies

B. Cuenca Grau, I. Horrocks, M. Krötzsch, C. Kupke, D. Magka, B. Motik, Z. Wang
2013 The Journal of Artificial Intelligence Research  
The chase, however, does not terminate necessarily, and checking whether the chase terminates on a given set of rules and facts is undecidable.  ...  In this paper, we present two new acyclicity notions called model-faithful acyclicity (MFA) and model-summarising acyclicity (MSA).  ...  Acknowledgments This work was supported by the Royal Society, the Seventh Framework Program (FP7) of the European Commission under Grant Agreement 318338, 'Optique', and the EPSRC projects ExODA, Score  ... 
doi:10.1613/jair.3949 fatcat:rclovclppfetrloce64n5i37ru

Compiling Esterel into sequential code

Stephen A. Edwards
2000 Proceedings of the 37th conference on Design automation - DAC '00  
It translates an Esterel program into an acyclic concurrent controlflow graph from which code is synthesized that runs instructions in an order respecting inter-thread communication.  ...  Exceptions and preemption constructs become conditional branches. Variables save control state; conditional branches restore it.  ...  In the second and later cycles, control starts at the root of the tree and heads toward the halts reached in the last cycle.  ... 
doi:10.1145/337292.337429 dblp:conf/dac/Edwards00 fatcat:5nmd4xolyzhfxdc4tuqnwa5zdy

Compiling Esterel into sequential code

Stephen A. Edwards
1999 Proceedings of the seventh international workshop on Hardware/software codesign - CODES '99  
It translates an Esterel program into an acyclic concurrent controlflow graph from which code is synthesized that runs instructions in an order respecting inter-thread communication.  ...  Exceptions and preemption constructs become conditional branches. Variables save control state; conditional branches restore it.  ...  In the second and later cycles, control starts at the root of the tree and heads toward the halts reached in the last cycle.  ... 
doi:10.1145/301177.301514 dblp:conf/codes/Edwards99 fatcat:gmw445hd3fhzfgbvktygkimg5e

Local Refinement Typing [article]

Benjamin Cosman, Ranjit Jhala
2017 arXiv   pre-print
We have implemented Fusion and evaluated it on the benchmarks from the LiquidHaskell suite totalling about 12KLOC.  ...  the most precise refinement types for all intermediate terms (expressible in the decidable refinement logic), thereby checking the program without false alarms.  ...  ACKNOWLEDGMENTS We thank the anonymous referees, Nadia Polikarpova, Eric Seidel and Niki Vazou for their invaluable feedback on earlier drafts of this paper.  ... 
arXiv:1706.08007v1 fatcat:icxwldnukzgrzn2bntm47cc3ty

Detecting Chase (Non)Termination for Existential Rules with Disjunctions

David Carral, Irina Dragoste, Markus Krötzsch
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
Experiments on real-world ontologies show that our acyclicity notions improve significantly over known criteria.  ...  The restricted chase is a sound and complete algorithm for conjunctive query answering over ontologies of disjunctive existential rules. We develop acyclicity conditions to ensure its termination.  ...  An instance I is a finite set of function-free facts. A program is a pair R, I with R a rule set and I an instance.  ... 
doi:10.24963/ijcai.2017/128 dblp:conf/ijcai/CarralDK17 fatcat:42ngbxpmdrfoli4on7m3g4cyjy

Fuzzy answer set computation via satisfiability modulo theories

MARIO ALVIANO, RAFAEL PEÑALOZA
2015 Theory and Practice of Logic Programming  
Moreover, head cycle free rules can be replaced by shifted subprograms, whose structure depends on the eliminated head connective, so that ordered completion may replace the minimality check if also Łukasiewicz  ...  AbstractFuzzy answer set programming (FASP) combines two declarative frameworks, answer set programming and fuzzy logic, in order to model reasoning by default over imprecise information.  ...  "KnowRex", by the National Group for Scientific Computation (GNCS-INDAM), and by Finanziamento Giovani Ricercatori UNICAL.  ... 
doi:10.1017/s1471068415000241 fatcat:3fafa7md3zgp3g2pixbshikuiy
« Previous Showing results 1 — 15 out of 1,240 results