Sciweavers

395 search results - page 52 / 79
» Predicate Abstraction with Minimum Predicates
Sort
View
LRE
2008
100views more  LRE 2008»
13 years 9 months ago
LTAG-spinal and the Treebank
Abstract. We introduce LTAG-spinal, a novel variant of traditional Lexicalized Tree Adjoining Grammar (LTAG) with desirable linguistic, computational and statistical properties. Un...
Libin Shen, Lucas Champollion, Aravind K. Joshi
ENTCS
2007
113views more  ENTCS 2007»
13 years 9 months ago
A Formalization of Strong Normalization for Simply-Typed Lambda-Calculus and System F
We formalize in the logical framework ATS/LF a proof based on Tait’s method that establishes the simply-typed lambda-calculus being strongly normalizing. In malization, we emplo...
Kevin Donnelly, Hongwei Xi
TOCL
2008
128views more  TOCL 2008»
13 years 9 months ago
A comprehensive combination framework
fragment enjoys suitable noetherianity conditions and admits an abstract version of a `KeislerShelah like' isomorphism theorem. We show that this general decidability transfer...
Silvio Ghilardi, Enrica Nicolini, Daniele Zucchell...
CL
2000
Springer
13 years 9 months ago
A New Equational Foundation for the Fluent Calculus
Abstract. A new equational foundation is presented for the Fluent Calculus, an established predicate calculus formalism for reasoning about actions. We discuss limitations of the e...
Hans-Peter Störr, Michael Thielscher
ECCC
2000
113views more  ECCC 2000»
13 years 9 months ago
Candidate One-Way Functions Based on Expander Graphs
Abstract. We suggest a candidate one-way function using combinatorial constructs such as expander graphs. These graphs are used to determine a sequence of small overlapping subsets...
Oded Goldreich