Sciweavers

1950 search results - page 305 / 390
» Lambda-Free Logical Frameworks
Sort
View
ANLP
2000
123views more  ANLP 2000»
15 years 7 months ago
Generating Text with a Theorem Prover
The process of documenting designs is tedious and often error-prone. We discuss a system that automatically generates documentation for the single step transition behavior of Stat...
Ivan I. Garibay
COLING
1994
15 years 7 months ago
Universal Guides And Finiteness And Symmetry Of Grammar Processing Algorithms
This paper presents a novel technique called "universal guides" which explores inherent properties of logic grammars (changing variable binding status) in order to chara...
Miroslav Martinovic
IJCAI
1993
15 years 7 months ago
Nonmonotonic Model Inference-A Formalization of Student Modeling
A student model description language and its synthesis method are presented. The language called SMDL is based on a logic programming language taking 4 truth values such as true, ...
Mitsuru Ikeda, Yasuyuki Kono, Riichiro Mizoguchi
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
15 years 7 months ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia
APAL
2008
90views more  APAL 2008»
15 years 6 months ago
On the unity of duality
Most type systems are agnostic regarding the evaluation strategy for the underlying languages, with the value restriction for ML which is absent in Haskell as a notable exception....
Noam Zeilberger