Sciweavers

7456 search results - page 412 / 1492
» Parallelism in Logic Programming
Sort
View
POPL
2007
ACM
16 years 7 months ago
Logic-flow analysis of higher-order programs
This work presents a framework for fusing flow analysis and theorem proving called logic-flow analysis (LFA). The framework itthe reduced product of two abstract interpretations: ...
Matthew Might
ATAL
2009
Springer
16 years 1 months ago
Agent programming with temporally extended goals
In planning as well as in other areas, temporal logic has been used to specify so-called temporally extended goals. Temporally extended goals refer to desirable sequences of state...
Koen V. Hindriks, Wiebe van der Hoek, M. Birna van...
AGP
2003
IEEE
16 years 2 days ago
Ordered Programs as Abductive Systems
In ordered logic programs, i.e. partially ordered sets of clauses where smaller rules carry more preference, inconsistencies, which appear as conflicts between applicable rules, a...
Davy Van Nieuwenborgh, Dirk Vermeir
ICALP
1994
Springer
15 years 11 months ago
Simple Fast Parallel Hashing
A hash table is a representation of a set in a linear size data structure that supports constanttime membership queries. We show how to construct a hash table for any given set of...
Joseph Gil, Yossi Matias
ICFP
2010
ACM
15 years 7 months ago
Polyvariant flow analysis with higher-ranked polymorphic types and higher-order effect operators
We present a type and effect system for flow analysis that makes essential use of higher-ranked polymorphism. We show that, for higher-order functions, the expressiveness of highe...
Stefan Holdermans, Jurriaan Hage