Sciweavers

305 search results - page 26 / 61
» Decidability of Split Equivalence
Sort
View
ASIAN
2004
Springer
78views Algorithms» more  ASIAN 2004»
14 years 1 months ago
A Simple Theory of Expressions, Judgments and Derivations
We propose a simple theory of expressions which is intended to be used as a foundational syntactic structure for the Natural Framework (NF). We define expression formally and give...
Masahiko Sato
IPPS
1998
IEEE
13 years 12 months ago
On the Automatic Validation of Parameterized Unity Programs
We study the automation of the verification of Unity programs with infinite or parameterized state space. This paper presents methods allowing the transformation of some second-ord...
Jean-Paul Bodeveix, Mamoun Filali
APAL
2005
73views more  APAL 2005»
13 years 7 months ago
Finite information logic
We introduce a generalization of Independence Friendly (IF) logic in which Eloise (the player) is restricted to a finite amount of information about Abelard's ('s) move...
Rohit Parikh, Jouko A. Väänänen
IPL
2000
94views more  IPL 2000»
13 years 7 months ago
On rewrite constraints and context unification
We show that stratified context unification, which is one of the most expressive fragments of context unification known to be decidable, is equivalent to the satisfiability proble...
Joachim Niehren, Sophie Tison, Ralf Treinen
WWW
2009
ACM
14 years 8 months ago
A method of analyzing credibility based on LOD control of digital maps
Digital maps are widely used and appear on all types of platforms for integrating content. Users can change display region and scale by panning, zooming in, and zooming out on a d...
Daisuke Kitayama, Ryong Lee, Kazutoshi Sumiya