1581 search results - page 42 / 317 » Mechanizing Inductive Reasoning |
232
click to vote
POPL
2006
ACM
16 years 2 months ago
2006
ACM
We introduce a new notion of bisimulation for showing contextual equivalence of expressions in an untyped lambda-calculus with an explicit store, and in which all expressed values...
110
click to vote
ENTCS
2007
15 years 2 months ago
2007
d Abstract) Brian Aydemir Aaron Bohannon Stephanie Weirich Department of Computer and Information Science University of Pennsylvania Philadelphia, PA, USA We explore an axiomatize...
109
Voted
IAT
2008
IEEE
15 years 9 months ago
2008
IEEE
This paper presents an architecture for a memory model that facilitates versatile reasoning mechanisms over the beliefs stored in an agent’s belief base. Based on an approach fo...
127
Voted
LICS
2009
IEEE
15 years 9 months ago
2009
IEEE
The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known decidable by algorithms exclusively based on the class...
128
click to vote
IJCNLP
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. Partial parsing techniques try to recover syntactic information efficiently and reliably by sacrificing completeness and depth of analysis. One of the difficulties of pa...