A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Inductive Verification of Hybrid Automata with Strongest Postcondition Calculus
[chapter]

2013
*
Lecture Notes in Computer Science
*

Our proposed algorithm

doi:10.1007/978-3-642-38613-8_10
fatcat:zy4cq63vebcczhikod2mzlngiu
*efficiently*performs*inductive*reasoning by unrolling the*execution*for some steps and generating loop invariants*from*verification failures. ... First, we encode the*execution*trace*of*a hybrid automaton as an imperative*program*. Its safety property is then translated into proof obligations by strongest postcondition calculus. ... If we perform the validation*of*VCs in ascending order, we can compute SP i*from*SP i−1*efficiently*. ...##
###
April – An Inductive Logic Programming System
[chapter]

2006
*
Lecture Notes in Computer Science
*

*Inductive*

*Logic*

*Programming*(ILP) is a Machine Learning research field that has been quite successful in knowledge discovery in relational domains. ... ILP systems use a set

*of*pre-classified

*examples*(positive and negative) and prior knowledge to learn a theory in which positive

*examples*succeed and the negative

*examples*fail. ... Introduction There is a strong connection between

*Inductive*

*Logic*

*Programming*(ILP) and

*Logic*

*Programming*. ...

##
###
An inductive logic programming query language for database mining
[chapter]

1998
*
Lecture Notes in Computer Science
*

RDM integrates concepts

doi:10.1007/bfb0055898
fatcat:7k7wix3awndifapd3bzxfk5gkq
*from**inductive**logic**programming*, constraint*logic**programming*, deductive databases and meta-*programming*into a flexible environment for relational knowledge discovery in databases ... The proposal for an*inductive**logic**programming*query language puts*inductive**logic**programming*into a new perspective. ... Acknowledgements The author is supported by the Fund for Scientific Research, Flanders, and by the ESPRIT IV project no 20237 on*Inductive**Logic**Programming*II. ...##
###
Executing Higher Order Logic
[chapter]

2002
*
Lecture Notes in Computer Science
*

Specifications consisting

doi:10.1007/3-540-45842-5_2
fatcat:sjktt7lu2jbzfngiaq7va3jqxa
*of*datatypes, recursive functions and*inductive*definitions are compiled into a functional*program*. Functions and*inductively*defined relations can be mixed. ... Tail recursive partial functions can be defined and*executed*with the help*of*a while combinator. ... Our aim has not been to reach or extend the limits*of*functional-*logic**programming*but to design a lightweight and*efficient**execution*mechanism for HOL specifications that requires only a functional*programming*...##
###
A List-machine Benchmark for Mechanized Metatheory

2007
*
Electronical Notes in Theoretical Computer Science
*

We propose a benchmark to compare theorem-proving systems on their ability to express proofs

doi:10.1016/j.entcs.2007.01.020
fatcat:mh33agitavfbbdkrrrypxdcjxe
*of*compiler correctness. ... In contrast to the first POPLmark, we emphasize the connection*of*proofs to compiler implementations, and we point out that much can be done without binders or alpha-conversion. ... Twelf makes it very easy to interpret*inductive*definitions as*logic**programs*. Therefore this task was trivial in Twelf. Coq does not provide a general mechanism to*execute**inductive*definitions. ...##
###
Efficient Data Structures for Inductive Logic Programming
[chapter]

2003
*
Lecture Notes in Computer Science
*

Both

doi:10.1007/978-3-540-39917-9_10
fatcat:jobfcmnplfhldhuxk7bdkko2mm
*examples*and background knowledge are usually represented as*logic**programs*. ... An extended version*of*this paper available as a technical report [?]. Coverage Caching The objective*of*an ILP system is the*induction**of**logic**programs*. ...##
###
IndLog — Induction in Logic
[chapter]

2004
*
Lecture Notes in Computer Science
*

IndLog is a general purpose Prolog-based

doi:10.1007/978-3-540-30227-8_65
fatcat:z6wuikxwabbp7gghasoduiy4na
*Inductive**Logic**Programming*(ILP) system. ... To search*efficiently*through large hypothesis spaces, IndLog uses original features like lazy evaluation*of**examples*and Language Level Search. ... Introduction The objective*of*an ILP system is the*induction**of**logic**programs*. ...##
###
Evaluation strategies for functional logic programming

2005
*
Journal of symbolic computation
*

Recent advances in the foundations and the implementations

doi:10.1016/j.jsc.2004.12.007
fatcat:swjeqk5wgfaf3nai5v5ufuws7q
*of*functional*logic**programming*languages originate*from*far-reaching results on narrowing evaluation strategies. ... In functional*logic**programming*, the classes*of*rewrite systems to which narrowing is applied are, for the most part, subclasses*of*the constructor-based, possibly conditional, rewrite systems. ... and*Programming*held in Utrecht, The Netherlands, in May 2001. ...##
###
Evaluation Strategies for Functional Logic Programming

2001
*
Electronical Notes in Theoretical Computer Science
*

Recent advances in the foundations and the implementations

doi:10.1016/s1571-0661(04)00265-8
fatcat:zpcju56vxba7dlr5uq4cyr7gma
*of*functional*logic**programming*languages originate*from*far-reaching results on narrowing evaluation strategies. ... In functional*logic**programming*, the classes*of*rewrite systems to which narrowing is applied are, for the most part, subclasses*of*the constructor-based, possibly conditional, rewrite systems. ... and*Programming*held in Utrecht, The Netherlands, in May 2001. ...##
###
System Description: Twelf — A Meta-Logical Framework for Deductive Systems
[chapter]

1999
*
Lecture Notes in Computer Science
*

Twelf is a meta-

doi:10.1007/3-540-48660-7_14
fatcat:ysgd47xcbzbybccjwjaecilgke
*logical*framework for the specification, implementation, and meta-theory*of*deductive systems*from*the theory*of**programming*languages and*logics*. ... The current version (1.2) is distributed with a complete manual,*example*suites, a tutorial in the form*of*on-line lecture notes [Pfe], and an Emacs interface. ... We would like to thank Iliano Cervesato for his contributions to the*logic**programming*component*of*Twelf. ...##
###
Sciduction: Combining Induction, Deduction, and Structure for Verification and Synthesis
[article]

2012
*
arXiv
*
pre-print

*Inductive*inference, which generalizes

*from*specific instances to yield a concept, includes algorithmic learning

*from*

*examples*. ...

*Examples*include the verification

*of*quantitative properties

*of*software involving constraints on timing and energy consumption, and the automatic synthesis

*of*systems

*from*specifications. ... Acknowledgments This article is a result

*of*ideas synthesized and verified (!) over the last few years in collaboration with several students and colleagues. ...

##
###
Constructor-based conditional narrowing

2001
*
Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming - PPDP '01
*

In this context, we analyze the

doi:10.1145/773184.773205
dblp:conf/ppdp/Antoy01
fatcat:wkoqhitlwrdhjmi56y2trarigm
*efficiency*and practicality*of*using our transformation for the implementation*of*functional*logic**programming*languages. ... We define a transformation*from*a left-linear constructor-based conditional rewrite system into an overlapping*inductively*sequential rewrite system. ... Acknowledgement I am grateful to Eva Ullan and the anonymous reviewers for their comments and suggestions on the initial version*of*this paper. ...##
###
Software engineering and automated deduction

2014
*
Proceedings of the on Future of Software Engineering - FOSE 2014
*

Then we consider some

doi:10.1145/2593882.2593899
dblp:conf/icse/VisserBS14
fatcat:cdgga6syovar5hr4mfzjyyi4se
*of*the current and future trends in software engineering and the type*of*advances it may require*from*automated deduction. ... We focus on the underlying technology by which a number*of*these problems can be reduced to a*logical*form and answered using automated deduction. ...*Logic*can thus be used to characterize the possible inputs to a*program*, the range*of*values assigned to variables at a*program*point, the possible*execution*steps*of*a*program*, the effects*of*these*execution*...##
###
On the use of inductive reasoning in program synthesis: Prejudice and prospects
[chapter]

1994
*
Lecture Notes in Computer Science
*

In this position paper, we give a critical analysis

doi:10.1007/3-540-58792-6_5
fatcat:bbpgkfzu7jchbntdh3veq4nkna
*of*the deductive and*inductive*approaches to*program*synthesis, and*of*the current research in these fields. ...*From*the shortcomings*of*these approaches and works, we identify future research directions for these fields, as well as a need for cooperation and cross-fertilization between them. 1. ... The first author also benefitted*from*the feedback*of*the students*of*his Automatic*Program*Synthesis course at Bilkent University. ...##
###
Programming with proofs: A second order type theory
[chapter]

1988
*
Lecture Notes in Computer Science
*

The

doi:10.1007/3-540-19027-9_10
fatcat:k6bbr3zwsrd6houpou3vielsuy
*logical*framework we use is presented in [13] , The main objection to that kind*of*approach to*programming*being the inefficiency*of*the*program*produced by proofs, the greater part*of*the paper is ... devoted to investigate how to define data types and how to construct*programs*for combining proofs and*efficiency*. ... (ii) the*efficient*algorithms*of*pure lambda-calculus do not always come*from*proofs, even in second order intuitionistic*logic*. ...
« Previous

*Showing results 1 — 15 out of 48,690 results*