Filters








394 Hits in 5.3 sec

Page 442 of Mathematical Reviews Vol. , Issue 91A [page]

1991 Mathematical Reviews  
{For the entire collection see MR 90i:68005.} 91a:68251 68T25 03B70 68N17 68Q60 Plimer, Lutz (D-DORT) Predicate inequalities as a basis for automated termination proofs for Prolog programs.  ...  A technique for the deduction of valid linear inequalities for predicates is described.”  ... 

A Survey of Automated Deduction [chapter]

Alan Bundy
1999 Lecture Notes in Computer Science  
Automated deduction seemed a very good candidate for the automation of commonsense reasoning.  ...  The area is characterised by its wide variety of proof methods, forms of automated deduction and applications.  ...  Logic Programming & Deductive Databases Prolog gives a procedural interpretation to a fragment o f rst order, predicate logic.  ... 
doi:10.1007/3-540-48317-9_6 fatcat:r7kti6fn2bcjbodyatqdq64wu4

Termination of logic programs: the never-ending story

Danny de Schreye, Stefaan Decorte
1994 The Journal of Logic Programming  
At this point, we justify the title by presenting an extensive survey on: Termination of Logic Programs: the Never-Ending Story (see tirst page).  ...  Apt Martens for proofreading drafts of the paper, to K. Verschaetse for allowing us to adapt a few paragraphs from his Ph.D., and to C. Hogger for inspiring the title.  ...  Then, [18] uses inductive termination proof techniques, for Functional Programs, adapted from the work of to prove the termination or nontermination of the Prolog program.  ... 
doi:10.1016/0743-1066(94)90027-2 fatcat:ukeksb2uzjdnpddgp52hgrnp6a

Inference of termination conditions for numerical loops in Prolog [article]

Alexander Serebrenik, Danny De Schreye
2003 arXiv   pre-print
Our approach is based on transforming a program in a way that allows integrating and extending techniques originally developed for analysis of numerical computations in the framework of query-mapping pairs  ...  We present a new approach to termination analysis of numerical computations in logic programs. Traditional approaches fail to analyse them due to non well-foundedness of the integers.  ...  These observations form a basis for definition of a primitive level mapping. Definition 12 Let p c be an adorned predicate.  ... 
arXiv:cs/0110034v2 fatcat:p7vmah7k2vcdjkzo6qunmt6fdy

Polytool: polynomial interpretations as a basis for termination analysis of Logic programs [article]

Manh Thang Nguyen, Danny De Schreye, Jürgen Giesl, Peter Schneider-Kamp
2009 arXiv   pre-print
Our goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm.  ...  ) ter- mination analysis techniques for definite logic programs (LPs).  ...  Automating the Termination Proof A key question is how to automate the search for a polynomial interpretation and for interargument relations.  ... 
arXiv:0912.4360v1 fatcat:yifcmy4k4rd6dctvjk4f7wgtvy

Inference of Termination Conditions for Numerical Loops in Prolog [chapter]

Alexander Serebrenik, Danny De Schreye
2001 Lecture Notes in Computer Science  
Our approach is based on transforming a program in a way that allows integrating and extending techniques originally developed for analysis of numerical computations in the framework of query-mapping pairs  ...  Our approach is based on transforming a program in a way that allows integrating and extending techniques originally developed for analysis of numerical computations in the framework of query-mapping pairs  ...  These observations form a basis for definition of a primitive level mapping. Definition 12 Let p c be an adorned predicate.  ... 
doi:10.1007/3-540-45653-8_45 fatcat:7nlgv44xcnavdnbwmqlyz2u3eu

A Logic Programming Framework for Combinational Circuit Synthesis [article]

Paul Tarau, Brenda Luderman
2008 arXiv   pre-print
This paper attempts to reconnect the two fields with a fresh look at Prolog encodings for the combinatorial objects involved in circuit synthesis.  ...  Logic Programming languages and combinational circuit synthesis tools share a common "combinatorial search over logic formulae" background.  ...  Size-constraints, ensuring termination of the recursive predicate generate_expression_tree/7, are encoded as a finite list of nodes, using DCG notation.  ... 
arXiv:0804.2095v1 fatcat:lvpawqzg25flzo6fjjkbafy2ie

Polytool: Polynomial interpretations as a basis for termination analysis of logic programs

MANH THANG NGUYEN, DANNY DE SCHREYE, JÜRGEN GIESL, PETER SCHNEIDER-KAMP
2010 Theory and Practice of Logic Programming  
analysis techniques for definite logic programs (LPs).  ...  AbstractOur goal is to study the feasibility of porting termination analysis techniques developed for one programming paradigm to another paradigm.  ...  Automating the Termination Proof A key question is how to automate the search for a polynomial interpretation and for interargument relations.  ... 
doi:10.1017/s1471068410000025 fatcat:uyyknxv7lbggde5vpyww4gtb3a

Middle-Out Reasoning for Synthesis and Induction [chapter]

Ina Kraan, David Basin, Alan Bundy
1996 Automated Mathematical Induction  
We propose a novel approach to automating the synthesis of logic programs: Logic programs are synthesized as a by-product of the planning of a veri cation proof.  ...  The approach is a two-level one: At the object level, we prove program veri cation conjectures in a sorted, rst-order theory. The conjectures are of the form 8args ????! : prog(args ????!  ...  Translated into Prolog, for instance, this becomes: 2 For the purpose of this paper, the set consists of equality (=) and inequality (6 =).  ... 
doi:10.1007/978-94-009-1675-3_4 fatcat:hlrfxol3oreppivyqvd5k7rzyy

Proving properties of committed choice logic programs

Lee Naish
1989 The Journal of Logic Programming  
Don't care (or committed choice) nondeterminism can be introduced by operations such as commit. in Concurrent PROLOG and cut in sequential PROLOG.  ...  This paper presents a theoretical model of guarded clauses, which exhibits don't know nondeterminism and also has a guard construct like many parallel PROLOGs.  ...  We provide a methodology for proving all procedures in a program are failure-sound. This may require termination proofs of some parts of the program.  ... 
doi:10.1016/0743-1066(89)90010-1 fatcat:5kd3w5xelfbhzav6sz3qtodonq

Logical debugging

Nachum Dershowitz, Yuh-Jeng Lee
1993 Journal of symbolic computation  
A methodology for reasoning about logic programs and their specifications is applied to program debugging as well as program synthesis.  ...  Both deductive and inductive inference techniques are employed for bug correction and synthesis. The behavior of the automated debugger is demonstrated through several examples.  ...  We would also like to thank the referees for their helpful comments on an earlier draft of this paper.  ... 
doi:10.1016/s0747-7171(06)80011-8 fatcat:4pdirnzle5cshi7d7gqe6zaemm

Mockingbird: A logical methodology for testing

Michael M. Gorlick, Carl F. Kesselman, Daniel A. Marotta, D. Stott Parker
1990 The Journal of Logic Programming  
The goal for this program will always be a single predicate of arity one when this program is used as a Mockingbird validator or generator.  ...  A specification compiler, written in PROLOG, takes a specification as input and produces an equivalent C program as output.  ...  Like Bird and Munoz [3] , we automated this process to a considerable degree.  ... 
doi:10.1016/0743-1066(90)90053-8 fatcat:avfazcsn65cwdcjaplozy56kiu

An Integrated Approach to High Integrity Software Verification

Andrew Ireland, Bill J. Ellis, Andrew Cook, Roderick Chapman, Janet Barnes
2006 Journal of automated reasoning  
We minimise this burden by increasing the automation, via an integration of proof planning and a program analysis oracle.  ...  However, where this automation fails, the programmer is burdened with the task of interactively constructing a proof and possibly also having to supply auxiliary program annotations.  ...  The research reported in this paper is a collaboration with Praxis High Integrity Systems Ltd.  ... 
doi:10.1007/s10817-006-9034-1 fatcat:kdzc2dkiwbgxtlkthyljo7awm4

On the use of advanced logic programming languages in computational linguistics

Solange Coupet-Grimal, Olivier Ridoux
1995 The Journal of Logic Programming  
Logic Programming, via Prolog, can be considered as a by-product of studies on automating the analysis of natural language [10] .  ...  The semantics of AProlog is usually based on proof theory [37] rather than on model theory as for Prolog [33] .  ...  Thanks must also go to David Trotman and Luke Hornof for their careful reading of the paper.  ... 
doi:10.1016/0743-1066(95)00040-q fatcat:ph7ll7eoinekvll3i6o5ktyqsa

Termination Analysis of Logic Programs [chapter]

Alexander Serebrenik
2003 Lecture Notes in Computer Science  
Proving termination of general Prolog programs. In Ito, T. and Meyer, A., editors,  ...  For instance, Mercury (Henderson et al., 1999 ) is a modern declarative language specially designed for "programming in large."  ...  This approach makes possible the reuse of termination proofs obtained for the interpreted program as a base for termination proof of the meta-program.  ... 
doi:10.1007/978-3-540-24599-5_45 fatcat:ospyooh2gvbjnhcurwprmr2fi4
« Previous Showing results 1 — 15 out of 394 results