Sciweavers

662 search results - page 94 / 133
» Logic Programming with Ordered Disjunction
Sort
View
ICFP
2010
ACM
13 years 8 months ago
Parametricity and dependent types
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
Jean-Philippe Bernardy, Patrik Jansson, Ross Pater...
DIMACS
1996
13 years 9 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
PADL
2010
Springer
14 years 4 months ago
Prospective Storytelling Agents
Abstract. Prospective Logic Programming is a declarative framework supporting the specification of autonomous agents capable of anticipating and reasoning about hypothetical futur...
Gonçalo Lopes, Luís Moniz Pereira
PADL
1999
Springer
13 years 12 months ago
Or-Parallelism within Tabling
Abstract. One important advantage of logic programming is that it allows the implicit exploitation of parallelism. Towards this goal, we suggest that or-parallelism can be efficien...
Ricardo Rocha, Fernando M. A. Silva, Vítor ...
ASPLOS
2010
ACM
13 years 11 months ago
Butterfly analysis: adapting dataflow analysis to dynamic parallel monitoring
Online program monitoring is an effective technique for detecting bugs and security attacks in running applications. Extending these tools to monitor parallel programs is challeng...
Michelle L. Goodstein, Evangelos Vlachos, Shimin C...