Sciweavers

419 search results - page 59 / 84
» Translation of Aggregate Programs to Normal Logic Programs
Sort
View
RTA
2010
Springer
13 years 11 months ago
Declarative Debugging of Missing Answers for Maude
Abstract. Declarative debugging is a semi-automatic technique that starts from an incorrect computation and locates a program fragment responsible for the error by building a tree ...
Adrián Riesco, Alberto Verdejo, Narciso Mar...
ICFP
2008
ACM
14 years 7 months ago
Typed closure conversion preserves observational equivalence
Language-based security relies on the assumption that all potential attacks are bound by the rules of the language in question. When programs are compiled into a different languag...
Amal Ahmed, Matthias Blume
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...
SARA
2009
Springer
14 years 7 days ago
Rewriting Constraint Models with Metamodels
An important challenge in constraint programming is to rewrite constraint models into executable programs calculating the solutions. This phase of constraint processing may requir...
Raphaël Chenouard, Laurent Granvilliers, Rica...
ICLP
2007
Springer
14 years 1 months ago
HD-rules: A Hybrid System Interfacing Prolog with DL-reasoners
The paper presents a prototype system HD-Rules (Hybrid integration of Description Logic and Rules) that integrates normal clauses under the wellfounded semantics with ontologies sp...
Wlodzimierz Drabent, Jakob Henriksson, Jan Maluszy...