Sciweavers

143 search results - page 9 / 29
» Termination of Well-Typed Logic Programs
Sort
View
CADE
2009
Springer
14 years 8 months ago
A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs
Abstract. An approach based on term rewriting techniques for the automated termination analysis of imperative programs operating on integers is presented. An imperative program is ...
Stephan Falke, Deepak Kapur
ICLP
2010
Springer
13 years 6 months ago
Runtime Addition of Integrity Constraints in an Abductive Proof Procedure
Abductive Logic Programming is a computationally founded representation of abductive reasoning. In most ALP frameworks, integrity constraints express domainspecific logical relati...
Marco Alberti, Marco Gavanelli, Evelina Lamma
ICLP
1993
Springer
13 years 11 months ago
Control Generation for Logic Programs
A basic requirement of declarative programming is to free the programmer from the need to manually insert control annotations into the program. Here we study the execution of logi...
Stefan Lüttringhaus-Kappel
ICLP
1999
Springer
13 years 11 months ago
Bounded Nondeterminism of Logic Programs
We introduce the notion of bounded nondeterminism for logic programs and queries. A program and a query have bounded nondeterminism if there are finitely many refutations for the...
Dino Pedreschi, Salvatore Ruggieri
CADE
2011
Springer
12 years 7 months ago
Static Analysis of Android Programs
Android is a programming language based on Java and an operating system for embedded or mobile devices whose upper layers are written in that language. It features an extended even...
Étienne Payet, Fausto Spoto