275 search results - page 11 / 55 » Non-Termination Inference of Logic Programs |
105
click to vote
LPNMR
2005
Springer
15 years 3 months ago
2005
Springer
We describe an application of Abductive Logic Programming (ALP) to the analysis of an important class of DNA microarray experiments. We develop an ALP theory that provides a simple...
OOPSLA
2007
Springer
15 years 3 months ago
2007
Springer
Accidental mutation is a major source of difficult-to-detect errors in object-oriented programs. We have built tools that detect and prevent such errors. The tools include a java...
CONTEXT
2007
Springer
15 years 3 months ago
2007
Springer
This note describes a logical system based on concepts and contexts, whose aim is to serve as a representation language for meanings of natural language sentences. The logic is a t...
LOGCOM
2007
14 years 9 months ago
2007
We begin by showing how to faithfully encode the Classical Modal Display Logic (CMDL) of Wansing into the Calculus of Structures (CoS) of Guglielmi. Since every CMDL calculus enjo...
109
click to vote
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint s...