Sciweavers

275 search results - page 4 / 55
» Non-Termination Inference of Logic Programs
Sort
View
ESOP
2005
Springer
15 years 3 months ago
Determinacy Inference for Logic Programs
This paper presents a determinacy inference analysis for logic programs. The analysis infers determinacy conditions that, if satisfied by a call, ensures that it computes at most ...
Lunjin Lu, Andy King
PLDI
2012
ACM
13 years 3 days ago
Automated error diagnosis using abductive inference
When program verification tools fail to verify a program, either the program is buggy or the report is a false alarm. In this situation, the burden is on the user to manually cla...
Isil Dillig, Thomas Dillig, Alex Aiken
FUIN
2010
130views more  FUIN 2010»
14 years 8 months ago
SLGAD Resolution for Inference on Logic Programs with Annotated Disjunctions
Abstract. Logic Programs with Annotated Disjunctions (LPADs) allow to express probabilistic information in logic programming. The semantics of an LPAD is given in terms of the well...
Fabrizio Riguzzi
SAS
2005
Springer
118views Formal Methods» more  SAS 2005»
15 years 3 months ago
Inference of Well-Typings for Logic Programs with Application to Termination Analysis
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
Maurice Bruynooghe, John P. Gallagher, Wouter Van ...
66
Voted
LREC
2010
144views Education» more  LREC 2010»
14 years 11 months ago
Inferring Syntactic Rules for Word Alignment through Inductive Logic Programming
This paper presents and evaluates an original approach to automatically align bitexts at the word level. It relies on a syntactic dependency analysis of the source and target text...
Sylwia Ozdowska, Vincent Claveau