3573 search results - page 395 / 715 » Reasoning about Codata |
201
click to vote
PADL
2012
Springer
14 years 2 months ago
2012
Springer
Declarative networking is a programming methodology that enables developers to concisely specify network protocols and services, and directly compile these specifications into a d...
178
click to vote
ACL
2012
13 years 9 months ago
2012
Temporal reasoners for document understanding typically assume that a document’s creation date is known. Algorithms to ground relative time expressions and order events often re...
187
click to vote
AAAI
2012
13 years 9 months ago
2012
We describe a new sound and complete method for compiling contingent planning problems with sensing actions into classical planning. Our method encodes conditional plans within a ...
191
click to vote
AAAI
2012
13 years 9 months ago
2012
Temporal Action Logics (TAL) is a class of temporal logics for reasoning about actions. We present a reformulation of TAL in Answer Set Programming (ASP), and discuss some synergi...
154
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
In many clustering applications, the user has some vague notion of the number and membership of the desired clusters. However, it is difficult for the user to provide such knowled...