Sciweavers

3047 search results - page 515 / 610
» On the Meaning of Logical Completeness
Sort
View
IJCAI
2003
14 years 11 months ago
Spaces of Theories with Ideal Refinement Operators
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...
Nicola Fanizzi, Stefano Ferilli, Nicola Di Mauro, ...
EACL
1993
ACL Anthology
14 years 11 months ago
A Strategy for Dynamic Interpretation: a Fragment and an Implementation
The strategy for natural language interpretation presented in this paper implements the dynamics of context change by translating natural language texts into a meaning representat...
Olivier Bouchez, Jan van Eijck, Olivier Istace
TLDI
2010
ACM
198views Formal Methods» more  TLDI 2010»
14 years 10 months ago
Verifying event-driven programs using ramified frame properties
Interactive programs, such as GUIs or spreadsheets, often maintain dependency information over dynamically-created networks of objects. That is, each imperative object tracks not ...
Neel R. Krishnaswami, Lars Birkedal, Jonathan Aldr...
CORR
2010
Springer
99views Education» more  CORR 2010»
14 years 10 months ago
A New Phase Transition for Local Delays in MANETs
: We study a slotted version of the Aloha Medium Access (MAC) protocol in a Mobile Ad-hoc Network (MANET). Our model features transmitters randomly located in the Euclidean plane, ...
François Baccelli, Bartek Blaszczyszyn
LOGCOM
1998
178views more  LOGCOM 1998»
14 years 9 months ago
Applying the Mu-Calculus in Planning and Reasoning about Action
Planning algorithms have traditionally been geared toward achievement goals in single-agent environments. Such algorithms essentially produce plans to reach one of a specified se...
Munindar P. Singh