Sciweavers

15 search results - page 2 / 3
» On the Undecidability of Second-Order Unification
Sort
View
CORR
2004
Springer
100views Education» more  CORR 2004»
13 years 6 months ago
On Spatial Conjunction as Second-Order Logic
Abstract. Spatial conjunction is a powerful construct for reasoning about dynamically allocated data structures, as well as concurrent, distributed and mobile computation. While re...
Viktor Kuncak, Martin C. Rinard
JSYML
2002
170views more  JSYML 2002»
13 years 6 months ago
Representability in Second-Order Propositional Poly-Modal Logic
A propositional system of modal logic is second-order if it contains quantifiers p and p, which, in the standard interpretation, are construed as ranging over sets of possible worl...
Gian Aldo Antonelli, Richmond H. Thomason
ACL
2006
13 years 7 months ago
Highly Constrained Unification Grammars
Unification grammars are widely accepted as an expressive means for describing the structure of natural languages. In general, the recognition problem is undecidable for unificati...
Daniel Feinstein, Shuly Wintner
ASIAN
1998
Springer
83views Algorithms» more  ASIAN 1998»
13 years 10 months ago
Rigid Reachability
We show that rigid reachability, the non-symmetric form of rigid E-unification, is undecidable already in the case of a single constraint. From this we infer the undecidability of ...
Harald Ganzinger, Florent Jacquemard, Margus Veane...
CADE
2004
Springer
14 years 6 months ago
Lambda Logic
Lambda logic is the union of first order logic and lambda calculus. We prove basic metatheorems for both total and partial versions of lambda logic. We use lambda logic to state a...
Michael Beeson