Sciweavers

1636 search results - page 250 / 328
» Type-Theoretic Functional Semantics
Sort
View
CAV
1999
Springer
119views Hardware» more  CAV 1999»
15 years 4 months ago
A Theory of Restrictions for Logics and Automata
BDDs and their algorithms implement a decision procedure for Quanti ed Propositional Logic. BDDs are a kind of acyclic automata. Unrestricted automata (recognizing unbounded string...
Nils Klarlund
ICFP
2010
ACM
15 years 29 days ago
Instance chains: type class programming without overlapping instances
Type classes have found a wide variety of uses in Haskell programs, from simple overloading of operators (such as equality or ordering) to complex invariants used to implement typ...
J. Garrett Morris, Mark P. Jones
BIODATAMINING
2008
135views more  BIODATAMINING 2008»
15 years 20 hour ago
Fast Gene Ontology based clustering for microarray experiments
Background: Analysis of a microarray experiment often results in a list of hundreds of diseaseassociated genes. In order to suggest common biological processes and functions for t...
Kristian Ovaska, Marko Laakso, Sampsa Hautaniemi
CORR
2002
Springer
141views Education» more  CORR 2002»
14 years 11 months ago
Question answering: from partitions to Prolog
Abstract. We implement Groenendijk and Stokhof's partition semantics of questions in a simple question answering algorithm. The algorithm is sound, complete, and based on tabl...
Balder ten Cate, Chung-chieh Shan
WWW
2003
ACM
16 years 17 days ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...