Sciweavers

579 search results - page 16 / 116
» Combined reasoning by automated cooperation
Sort
View
LACL
2001
Springer
14 years 1 months ago
Combinators for Paraconsistent Attitudes
Abstract. In order to analyse the semantics of natural language sentences a translation into a partial type logic using lexical and logical combinators is presented. The sentences ...
Jørgen Villadsen
EWCBR
2006
Springer
14 years 8 days ago
Combining Multiple Similarity Metrics Using a Multicriteria Approach
The design of a CBR system involves the use of similarity metrics. For many applications, various functions can be adopted to compare case features and to aggregate them into a glo...
Luc Lamontagne, Irène Abi-Zeid
ICLP
1999
Springer
14 years 27 days ago
CLAIRE: Combining Sets, Search, and Rules to Better Express Algorithms
This paper presents a programming language that includes paradigms that are usually associated with declarative languages, such as sets, rules and search, into an imperative (funct...
Yves Caseau, François-Xavier Josset, Fran&c...
PLILP
1994
Springer
14 years 21 days ago
Combining Lazy Narrowing with Disequality Constraints
Abstract. We investigate an extension of a lazy functional logic language, which uses term disequations both in programs and in computed answers. The semantic properties of the lan...
Puri Arenas-Sánchez, Ana Gil-Luezas, Franci...
FLOPS
2010
Springer
14 years 1 months ago
Tag-Free Combinators for Binding-Time Polymorphic Program Generation
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
Peter Thiemann, Martin Sulzmann