Sciweavers

283 search results - page 9 / 57
» Extracting Program Logics From Abstract Interpretations Defi...
Sort
View
CP
2009
Springer
14 years 8 months ago
From Model-Checking to Temporal Logic Constraint Solving
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
Aurélien Rizk, François Fages
ILP
2004
Springer
14 years 1 months ago
Learning Logic Programs with Annotated Disjunctions
Abstract. Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we ...
Fabrizio Riguzzi
ICFP
2012
ACM
11 years 10 months ago
Proof-producing synthesis of ML from higher-order logic
The higher-order logic found in proof assistants such as Coq and various HOL systems provides a convenient setting for the development and verification of pure functional program...
Magnus O. Myreen, Scott Owens
LOPSTR
2000
Springer
13 years 11 months ago
A formal framework for synthesis and verification of logic programs
In this paper we will present a formal framework, based on the notion of extraction calculus, which has been successfully applied to define procedures for extracting information fr...
Alessandro Avellone, Mauro Ferrari, Camillo Fioren...
CORR
2006
Springer
99views Education» more  CORR 2006»
13 years 7 months ago
Logical settings for concept learning from incomplete examples in First Order Logic
We investigate here concept learning from incomplete examples. Our first purpose is to discuss to what extent logical learning settings have to be modified in order to cope with da...
Dominique Bouthinon, Henry Soldano, Véroniq...