Sciweavers

3470 search results - page 333 / 694
» Head-Elementary-Set-Free Logic Programs
Sort
View
AAAI
1992
15 years 7 months ago
Lexical Imprecision in Fuzzy Constraint Networks
We define fuzzy constraint networks and prove a theorem about their relationship to fuzzy logic. Then we introduce Khayyam, a fuzzy constraint-based programming language in which ...
James Bowen, K. Robert Lai, Dennis Bahler
CORR
2006
Springer
123views Education» more  CORR 2006»
15 years 6 months ago
Continuations, proofs and tests
Continuation Passing Style (CPS) is one of the most important issues in the field of functional programming languages, and the quest for a primitive notion of types for continuati...
Stefano Guerrini, Andrea Masini
ENTCS
2007
87views more  ENTCS 2007»
15 years 6 months ago
Aspect-orientation For Revitalising Legacy Business Software
This paper relates on a first attempt to see if aspect-oriented programming (AOP) and logic meta-programming (LMP) can help with the revitalisation of legacy business software. B...
Kris De Schutter, Bram Adams
LOGCOM
1998
110views more  LOGCOM 1998»
15 years 6 months ago
leanTAP Revisited
A sequent calculus of a new sort is extracted from the Prolog program leanTAP. This calculus is sound and complete, even though it lacks almost all structural rules. Thinking of l...
Melvin Fitting
CORR
2011
Springer
173views Education» more  CORR 2011»
15 years 1 months ago
Linear Dependent Types and Relative Completeness
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Ugo Dal Lago, Marco Gaboardi