Sciweavers

143 search results - page 25 / 29
» An axiomatic approach to algebrization
Sort
View
FSTTCS
1999
Springer
13 years 11 months ago
Hoare Logic for Mutual Recursion and Local Variables
We present a (the rst?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with call-by-value parameters...
David von Oheimb
KR
1998
Springer
13 years 11 months ago
AOL: A logic of Acting, Sensing, Knowing, and Only Knowing
This work is motivated by the existence of two useful but quite different knowledge representation formalisms, the situation calculus due to McCarthy, and the logic OL of only kno...
Gerhard Lakemeyer, Hector J. Levesque
ACL
2008
13 years 9 months ago
A Re-examination of Query Expansion Using Lexical Resources
Query expansion is an effective technique to improve the performance of information retrieval systems. Although hand-crafted lexical resources, such as WordNet, could provide more...
Hui Fang
ENTCS
2006
125views more  ENTCS 2006»
13 years 7 months ago
Formalizing Type Operations Using the "Image" Type Constructor
In this paper we introduce a new approach to formalizing certain type operations in type theory. Traditionally, many type constructors in type theory are independently axiomatized...
Aleksey Nogin, Alexei Kopylov
ENTCS
2007
105views more  ENTCS 2007»
13 years 7 months ago
Narrowing and Rewriting Logic: from Foundations to Applications
Narrowing was originally introduced to solve equational E-unification problems. It has also been recognized as a key mechanism to unify functional and logic programming. In both ...
Santiago Escobar, José Meseguer, Prasanna T...