Sciweavers

3481 search results - page 39 / 697
» Higher-Order Logic Programming as Constraint Logic Programmi...
Sort
View
ICLP
2007
Springer
14 years 20 days ago
Web Sites Verification: An Abductive Logic Programming Tool
We present the CIFFWEB system, an innovative tool for the verification of web sites, relying upon abductive logic programming. The system allows the user to define rules that a web...
Paolo Mancarella, Giacomo Terreni, Francesca Toni
ICLP
1997
Springer
14 years 28 days ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
ICALP
2007
Springer
14 years 3 months ago
Co-Logic Programming: Extending Logic Programming with Coinduction
In this paper we present the theory and practice of co-logic programming (co-LP for brevity), a paradigm that combines both inductive and coinductive logic programming. Co-LP is a ...
Luke Simon, Ajay Bansal, Ajay Mallya, Gopal Gupta
SAS
2001
Springer
117views Formal Methods» more  SAS 2001»
14 years 1 months ago
Finite-Tree Analysis for Constraint Logic-Based Languages
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
Roberto Bagnara, Roberta Gori, Patricia M. Hill, E...
PPDP
1999
Springer
14 years 1 months ago
Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices
We present a slicing approach for analyzing logic programs with respect to non-termination. The notion of a failure-slice is presented which is an executable reduced fragment of th...
Ulrich Neumerkel, Frédéric Mesnard