Sciweavers

3572 search results - page 46 / 715
» Nominal Logic Programming
Sort
View
122
Voted
LPAR
2005
Springer
15 years 6 months ago
Comparative Similarity, Tree Automata, and Diophantine Equations
The notion of comparative similarity ‘X is more similar or closer to Y than to Z’ has been investigated in both foundational and applied areas of knowledge representation and r...
Mikhail Sheremet, Dmitry Tishkovsky, Frank Wolter,...
100
Voted
LPNMR
2007
Springer
15 years 6 months ago
Programming Applications in CIFF
We show how to deploy the CIFF System 4.0 for abductive logic programming with constraints in a number of applications, ranging from combinatorial applications to web management. W...
Paolo Mancarella, Fariba Sadri, Giacomo Terreni, F...
APLAS
2004
ACM
15 years 4 months ago
McJava - A Design and Implementation of Java with Mixin-Types
A programming construct mixin was invented to implement uniform extensions and modifications to classes. Although mixin-based programming has been extensively studied both on the m...
Tetsuo Kamina, Tetsuo Tamai
AMAI
2006
Springer
15 years 16 days ago
Strong order equivalence
Abstract. Recently, notions of equivalence for Answer Set Programming have been studied intensively and were shown to be beneficial for modular programming and automated optimizati...
Wolfgang Faber, Kathrin Konczak
NMR
2004
Springer
15 years 5 months ago
Logic programs with annotated disjunctions
Current literature offers a number of different approaches to what could generally be called “probabilistic logic programming”. These are usually based on Horn clauses. Here, ...
Joost Vennekens, Sofie Verbaeten, Maurice Bruynoog...