Sciweavers

70 search results - page 7 / 14
» The senses of functions in the Logic of Sense and Denotation
Sort
View
INTERSENSE
2006
ACM
14 years 20 days ago
Programming wireless sensor networks with logical neighborhoods
— Wireless sensor network (WSN) architectures often feature a (single) base station in charge of coordinating the application functionality. Although this assumption simplified ...
Luca Mottola, Gian Pietro Picco
IJCAI
2007
13 years 8 months ago
Progression of Situation Calculus Action Theories with Incomplete Information
In this paper, we propose a new progression mechanism for a restricted form of incomplete knowledge formulated as a basic action theory in the situation calculus. Specifically, w...
Stavros Vassos, Hector J. Levesque
CORR
2011
Springer
173views Education» more  CORR 2011»
13 years 1 months ago
Linear Dependent Types and Relative Completeness
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Ugo Dal Lago, Marco Gaboardi
KR
2000
Springer
13 years 10 months ago
Approximate Objects and Approximate Theories
We propose to extend the ontology of logical AI to include approximate objects, approximate predicates and approximate theories. Besides the ontology we treat the relations among ...
John McCarthy
CSL
2007
Springer
14 years 27 days ago
The Power of Counting Logics on Restricted Classes of Finite Structures
Abstract. Although Cai, F¨urer and Immerman have shown that fixedpoint logic with counting (IFP + C) does not express all polynomialtime properties of finite structures, there h...
Anuj Dawar, David Richerby