Sciweavers

2540 search results - page 390 / 508
» Abstract Logics as Dialgebras
Sort
View
CORR
2002
Springer
141views Education» more  CORR 2002»
15 years 6 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
CP
2010
Springer
15 years 4 months ago
The Lattice Structure of Sets of Surjective Hyper-Operations
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
Barnaby Martin
LICS
1999
IEEE
15 years 10 months ago
Towards a Theory of Bisimulation for Local Names
Pitts and Stark have proposed the -calculus as a language for investigating the interaction of unique name generation and higher-order functions. They developed a sound model base...
Alan Jeffrey, Julian Rathke
FSTTCS
1999
Springer
15 years 10 months ago
A Foundation for Hybrid Knowledge Bases
Abstract. Hybrid knowledge bases (HKB’s) [11] were developed to provide formal models for the mediation of data and knowledge bases [14,15]. They are based on Generalized Annotat...
James J. Lu, Neil V. Murray, Erik Rosenthal
VL
1999
IEEE
120views Visual Languages» more  VL 1999»
15 years 10 months ago
Formalizing Spider Diagrams
Geared to complement UML and to the specification of large software systems by non-mathematicians, spider diagrams are a visual language that generalizes the popular and intuitive...
Joseph Gil, John Howse, Stuart Kent