Sciweavers

3441 search results - page 441 / 689
» Parallel Logic Programming Systems
Sort
View
PPDP
2004
Springer
15 years 10 months ago
Nominal rewriting systems
We present a generalisation of first-order rewriting which allows us to deal with terms involving binding operations in an elegant and practical way. We use a nominal approach to...
Maribel Fernández, Murdoch Gabbay, Ian Mack...
ATAL
2009
Springer
15 years 9 months ago
GDT4MAS: an extension of the GDT model to specify and to verify MultiAgent systems
The Goal Decomposition Tree model has been introduced in 2005 by Mermet et al. [9] to specify and verify the behaviour of an agent evolving in a dynamic environment. This model pr...
Bruno Mermet, Gaële Simon
CADE
2007
Springer
16 years 5 months ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur
ICLP
2007
Springer
15 years 11 months ago
Demand-Driven Indexing of Prolog Clauses
As logic programming applications grow in size, Prolog systems need to efficiently access larger and larger data sets and the need for any- and multiargument indexing becomes more...
Vítor Santos Costa, Konstantinos F. Sagonas...
EUROPAR
2009
Springer
15 years 11 months ago
MPI Applications on Grids: A Topology Aware Approach
Porting on grids complex MPI applications involving collective communications requires significant program modification, usually dedicated to a single grid structure. The diffi...
Camille Coti, Thomas Hérault, Franck Cappel...