3,080 Hits in 3.4 sec

Nontermination inference of logic programs

Etienne Payet, Fred Mesnard
2006 ACM Transactions on Programming Languages and Systems  
We present a static analysis technique for non-termination inference of logic programs.  ...  Then, non-termination inference is tailored to attempt proofs of optimality of left termination conditions computed by a termination inference tool.  ...  Hence, we reduce the problem of inferring looping atomic queries w.r.t. a logic program to that of inferring looping atomic queries w.r.t. a binary program.  ... 
doi:10.1145/1119479.1119481 fatcat:jnjnk43ctjcmnjsql5nscxzwvm

Logic-based genetic programming with definite clause translation grammars

Brian J. Ross
2001 New generation computing  
A DCTG is a logical version of an attribute grammar that supports the definition of context-free languages, and it allows semantic information associated with a language to be easily accomodated by the  ...  This is useful in genetic programming for defining the interpreter of a target language, or incorporating both syntactic and semantic problem-specific contraints into the evolutionary search.  ...  Note that a nonterminal can have multiple productions applicable to it. Using logic programming terminology, a goal is a nonterminal or terminal reference in the right-hand side of a production.  ... 
doi:10.1007/bf03037572 fatcat:ybx53tyi5vfy3auf3q4qpqkakm

Stochastic And-Or Grammars: A Unified Framework and Logic Perspective [article]

Kewei Tu
2016 arXiv   pre-print
Furthermore, we provide two interpretations of stochastic context-free AOGs as a subset of probabilistic logic, which connects stochastic AOGs to the field of statistical relational learning and clarifies  ...  We also propose a domain-independent inference algorithm of stochastic context-free AOGs and show its tractability under a reasonable assumption.  ...  ., tractable Markov logic [11] and stochastic logic programs [12] ).  ... 
arXiv:1506.00858v3 fatcat:t7nz7nhcnbdvjbfx7fyvcalttu

Statistical machine translation by parsing

I. Dan Melamed
2004 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics - ACL '04  
Such algorithms can infer the synchronous structures hidden in parallel texts.  ...  This paper explores generalizations of ordinary parsing algorithms that allow the input to consist of string tuples and/or the grammar to range over string tuples.  ...  This research was supported by an NSF CAREER Award, the DARPA TIDES program, and an equipment gift from Sun Microsystems.  ... 
doi:10.3115/1218955.1219038 dblp:conf/acl/Melamed04 fatcat:m7oz5oxqujfyjaeptvy2yhn3qm

Statistical Machine Translation by Generalized Parsing [article]

I. Dan Melamed, Wei Wang
2005 arXiv   pre-print
evaluation, can be derived by generalizing two of these parameters -- the grammar and the logic.  ...  In service of this goal, the article extends the theory of semiring parsing to arrive at a novel abstract parsing algorithm with five functional parameters: a logic, a grammar, a semiring, a search strategy  ...  This research was supported by an NSF CAREER Award, by the DARPA TIDES program, and by an equipment gift from Sun Microsystems.  ... 
arXiv:cs/0407005v3 fatcat:yvp6qtiyibgqxaxbrmzbmueqm4

SLR inference: An inference system for fixed-mode logic programs, based on SLR parsing

David A. Rosenblueth, Julio C. Peralta
1998 The Journal of Logic Programming  
SLR INFERENCE 229 instance, claims that the majority of practical logic programs have fixed modes, and shows examples of programming techniques in which multiple modes are used.  ...  Fixed-mode logic programs have also been studied in [3, 4, 10]. SLR PARSING This section reviews SLR parsing [2].  ...  As a result, our modified SLR parser becomes an inference system for fixed-mode logic programs.  ... 
doi:10.1016/s0743-1066(96)00076-3 fatcat:7nl6zwzbovexzlxiuvsqe77tay

Learning Shape Analysis [chapter]

Marc Brockschmidt, Yuxin Chen, Pushmeet Kohli, Siddharth Krishna, Daniel Tarlow
2017 Lecture Notes in Computer Science  
Our core contribution is a novel statistical machine learning technique that maps observed program states to (possibly disjunctive) separation logic formulas describing the invariant shape of (possibly  ...  Locust is able to automatically prove memory safety of implementations of classical heap-manipulating programs such as insertionsort, quicksort and traversals of nested data structures.  ...  We also thank Thomas Wies for valuable feedback on drafts of this paper.  ... 
doi:10.1007/978-3-319-66706-5_4 fatcat:zsjz6pkqx5a5naapr7hi2nth5m

Interactive proof checking

Thomas Reps, Bowen Alpern
1984 Proceedings of the 11th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '84  
Knowledge of logical inference rules shows s specialised proof editor to provide a user with feedback about errors in s proof under development.  ...  Providing such feedhlck involves checking a collection of constraints on the strings of the proof IsnKua~e.  ...  Acknowledgements We were stimulated to write this discussion of our work on interactive proof checking aider receiving encouragement from a number of people who had seen the prototype proof-checking editor  ... 
doi:10.1145/800017.800514 dblp:conf/popl/RepsA84 fatcat:ensoq7fiwnc6rnwiltxfphsndi

First-Order Logic Definability of Free Languages [chapter]

Violetta Lonati, Dino Mandrioli, Federica Panella, Matteo Pradella
2015 Lecture Notes in Computer Science  
FrGs were originally introduced for grammatical inference of programming languages.  ...  logic.  ...  We consider free grammars (FrGs) and languages (FrLs), which have been introduced with the main propose of supporting grammar inference [?,?] for programming languages.  ... 
doi:10.1007/978-3-319-20297-6_20 fatcat:atvrg2dplfeyjkkiy7mfxiqtta

Automatic Verification of Pointer Programs Using Grammar-Based Shape Analysis [chapter]

Oukseh Lee, Hongseok Yang, Kwangkeun Yi
2005 Lecture Notes in Computer Science  
of the program.  ...  We prove the correctness of our analysis by compiling it into separation logic.  ...  Outline Section 2 briefly describes the programming language that we would analyze, and Section 3 reviews separation logic which we use to give the meaning of abstract values.  ... 
doi:10.1007/978-3-540-31987-0_10 fatcat:rwdrw2ni7vbclepuffgsppohz4

Principles and implementation of deductive parsing

Stuart M. Shieber, Yves Schabes, Fernando C.N. Pereira
1995 The Journal of Logic Programming  
The method generalizes easily to parsers for augmented phrase structure formalisms, such as definiteclause grammars and other logic grammar formalisms, and has been used for rapid prototyping of parsing  ...  such copying is by permission of Mitsubishi Electric Research Laboratories, Inc.; an acknowledgment of the authors and individual contributions to the work; and all applicable portions of the copyright  ...  Proofs of Correctness Rather than implement each deductive system like the CYK one as a separate logic program, we will describe in Section 5 a meta-interpreter for logic programs obtained from grammatical  ... 
doi:10.1016/0743-1066(95)00035-i fatcat:ja6qi5hsmnconkele2u7arh7hy

Methods for Proving Termination of Rewriting-based Programming Languages by Transformation

Francisco Durán, Salvador Lucas, José Meseguer
2009 Electronical Notes in Theoretical Computer Science  
The operational meaning of such features is often formalized in a proof theoretic manner by means of an inference system rather than just by a rewriting relation.  ...  and tend to place such programs outside the scope of current termination tools.  ...  MEL or rewriting logic programs.  ... 
doi:10.1016/j.entcs.2009.07.062 fatcat:gf3lzx2eb5bl5glrlp7hfz26ia

The applicability of logic program analysis and transformation to theorem proving [chapter]

D. A. Waal, J. P. Gallagher
1994 Lecture Notes in Computer Science  
The specialisation techniques developed in this paper are independent of the proof system and can therefore be applied to theorem provers for any logic written as logic programs. 2  ...  In this paper we demonstrate how these techniques can be used to infer useful information that can speed up theorem provers, assist in the identi cation of necessary inference rules for solving speci c  ...  greatly to the overall appearance of this paper.  ... 
doi:10.1007/3-540-58156-1_15 fatcat:hxxcgtriynbjboqlxl3oq3vt34

Page 562 of Computational Linguistics Vol. 19, Issue 3 [page]

1993 Computational Linguistics  
A constraint grammar to perform type inference for a simple applica- tive programming language is evolved and its shortcomings are also described.  ...  Instances with respect to which it is possible to eliminate the redundant generation of items, to mitigate nontermination problems, or to specify a given control regime are also discussed.  ... 

Page 3634 of Mathematical Reviews Vol. , Issue 95f [page]

1995 Mathematical Reviews  
logic programs.  ...  to strings of nonterminals (whose lengths are polynomial-bounded)”.  ... 
« Previous Showing results 1 — 15 out of 3,080 results