3353 search results - page 158 / 671 » Laver and set theory |
201
click to vote
MATES
2005
Springer
15 years 12 months ago
2005
Springer
Defeasible Logic is extended to programming languages for cognitive agents with preferences and actions for planning. We define rule-based agent theories that contain preferences ...
145
click to vote
COCO
2001
Springer
15 years 11 months ago
2001
Springer
We use hypotheses of structural complexity theory to separate various NP-completeness notions. In particular, we introduce an hypothesis from which we describe a set in NP that is...
158
click to vote
NAACL
2004
15 years 7 months ago
2004
We propose a theory that gives formal semantics to word-level alignments defined over parallel corpora. We use our theory to introduce a linear algorithm that can be used to deriv...
144
click to vote
AMC
2006
15 years 6 months ago
2006
We first show that the Halting Function (the noncomputable function that solves the Halting Problem) has explicit expressions in the language of calculus. Out of that fact we elab...
211
click to vote
LOGCOM
2008
15 years 6 months ago
2008
We investigate mathematical modelling with theories of data types. We provide a formal setting for the formulation of such theories (TPL) and use it to introduce the notion of a c...