Sciweavers

2084 search results - page 119 / 417
» Set Constraints in Logic Programming
Sort
View
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
AMAI
2006
Springer
13 years 8 months ago
Answer set based design of knowledge systems
The aim of this paper is to demonstrate that A-Prolog is a powerful language for the construction of reasoning systems. In fact, A-Prolog allows to specify the initial situation, t...
Marcello Balduccini, Michael Gelfond, Monica Nogue...
ICFP
2008
ACM
14 years 8 months ago
From ML to MLF: graphic type constraints with efficient type inference
MLF is a type system that seamlessly merges ML-style type inference with System-F polymorphism. We propose a system of graphic (type) constraints that can be used to perform type ...
Boris Yakobowski, Didier Rémy
PPDP
2004
Springer
14 years 1 months ago
Just enough tabling
We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled...
Konstantinos F. Sagonas, Peter J. Stuckey
IPPS
2000
IEEE
14 years 17 days ago
Declarative Concurrency in Java
We propose a high-level language based on rst order logic for expressing synchronization in concurrent object-oriented programs. The language allows the programmer to declaratively...
Rafael Ramirez, Andrew E. Santosa