Sciweavers

7456 search results - page 464 / 1492
» Parallelism in Logic Programming
Sort
View
TPHOL
2003
IEEE
16 years 3 days ago
MetaPRL - A Modular Logical Environment
MetaPRL is the latest system to come out of over twenty five years of research by the Cornell PRL group. While initially created at Cornell, MetaPRL is currently a collaborative p...
Jason Hickey, Aleksey Nogin, Robert L. Constable, ...
JLP
2007
114views more  JLP 2007»
15 years 6 months ago
Deaccumulation techniques for improving provability
Several induction theorem provers were developed to verify functional programs mechanically. Unfortunately, automatic verification often fails for functions with accumulating arg...
Jürgen Giesl, Armin Kühnemann, Janis Voi...
ICLP
2009
Springer
16 years 7 months ago
One More Decidable Class of Finitely Ground Programs
When a logic program is processed by an answer set solver, the first task is to generate its instantiation. In a recent paper, Calimeri et el. made the idea of efficient instantiat...
Yuliya Lierler, Vladimir Lifschitz
SPAA
2009
ACM
16 years 7 months ago
An optimal local approximation algorithm for max-min linear programs
In a max-min LP, the objective is to maximise subject to Ax 1, Cx 1, and x 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorith...
Patrik Floréen, Joel Kaasinen, Petteri Kask...
IPPS
1999
IEEE
15 years 11 months ago
Examples of Program Composition Illustrating the Use of Universal Properties
Abstract. This paper uses a theory of composition based on existential and universal properties. Universal properties are useful to describe components interactions through shared ...
Michel Charpentier, K. Mani Chandy