Sciweavers

1206 search results - page 121 / 242
» Concurrent Abstract Predicates
Sort
View
ENTCS
2007
113views more  ENTCS 2007»
15 years 2 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»
15 years 2 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...
104
Voted
CL
2000
Springer
15 years 2 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
114
Voted
ECCC
2000
113views more  ECCC 2000»
15 years 2 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
109
Voted
FLAIRS
2009
15 years 11 days ago
Lifting the Limitations in a Rule-based Policy Language
The predicates that are used to encode a planning domain in PDDL often do not include concepts that are important for effectively reasoning about problems in the domain. In partic...
Alan Lindsay, Maria Fox, Derek Long