Sciweavers

850 search results - page 61 / 170
» A Logic Programming Language Based on Binding Algebras
Sort
View
UAI
2004
15 years 5 months ago
A Logic Programming Framework for Possibilistic Argumentation with Vague Knowledge
Defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning from incomplete and potentially inconsistent knowledge. ...
Carlos Iván Chesñevar, Guillermo Ric...
ICFP
1997
ACM
15 years 8 months ago
Implementing Bit-addressing with Specialization
General media-processing programs are easily expressed with bitaddressing and variable-sized bit-fields. But the natural implementation of bit-addressing relies on dynamic shift ...
Scott Draves
CSCLP
2008
Springer
15 years 6 months ago
From Rules to Constraint Programs with the Rules2CP Modelling Language
In this paper, we present a rule-based modelling language for constraint programming, called Rules2CP. Unlike other modelling languages, Rules2CP adopts a single knowledge represen...
François Fages, Julien Martin
DBPL
1993
Springer
104views Database» more  DBPL 1993»
15 years 8 months ago
Extensible Grammars for Language Specialization
A frequent dilemma in the design of a database programming language is the choice between a language with a rich set of tailored notations for schema definitions, query expression...
Luca Cardelli, Florian Matthes, Martín Abad...
115
Voted
LICS
2007
IEEE
15 years 10 months ago
Static Name Control for FreshML
FreshML extends ML with constructs for declaring and ting abstract syntax trees that involve names and statically scoped binders. It is impure: name generation is an observable si...
François Pottier