Sciweavers

2145 search results - page 277 / 429
» Lax Logical Relations
Sort
View
BIRTHDAY
2005
Springer
14 years 1 months ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau
KR
2004
Springer
14 years 1 months ago
Updating of a Possibilistic Knowledge Base by Crisp or Fuzzy Transition Rules
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...
Boris Mailhé, Henri Prade
FCCM
2003
IEEE
135views VLSI» more  FCCM 2003»
14 years 1 months ago
Efficient Application Representation for HASTE: Hybrid Architectures with a Single, Transformable Executable
Hybrid architectures, which are composed of a conventional processor closely coupled with reconfigurable logic, seem to combine the advantages of both types of hardware. They pres...
Benjamin A. Levine, Herman Schmit
LICS
2002
IEEE
14 years 1 months ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson
CIE
2010
Springer
14 years 26 days ago
Focusing in Asynchronous Games
Game semantics provides an interactive point of view on proofs, which enables one to describe precisely their dynamical behavior during cut elimination, by considering formulas as ...
Samuel Mimram