3470 search results - page 485 / 694 » Head-Elementary-Set-Free Logic Programs |
164
click to vote
ICLP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. They are characterised by the use of various constructors to build comp...
170
click to vote
CHI
2010
ACM
15 years 11 months ago
2010
ACM
Paper prototyping offers unique affordances for interface design. However, due to its spontaneous nature and the limitations of paper, it is difficult to distill and communicate a...
163
click to vote
ICFP
2008
ACM
16 years 6 months ago
2008
ACM
We report on an extension of Haskell with open type-level functions and equality constraints that unifies earlier work on GADTs, functional dependencies, and associated types. The...
150
click to vote
ICFP
2004
ACM
16 years 6 months ago
2004
ACM
It is possible to extend the basic notion of "function call" to allow functions to have multiple return points. This turns out to be a surprisingly useful mechanism. Thi...
125
click to vote
TACAS
2010
Springer
16 years 29 days ago
2010
Springer
Abstract. Heap-Hop is a program prover for concurrent heap-manipulating programs that use Hoare monitors and message-passing synchronization. Programs are annotated with pre and po...