918 search results - page 54 / 184 » Speculative Issue Logic |
149
click to vote
COLING
2002
15 years 5 months ago
2002
We present a principled approach to the problem of connecting a controlled document authoring system with a knowledge base. We start by describingclosed-world authoring situations...
155
click to vote
CORR
2002
Springer
15 years 5 months ago
2002
Springer
The Inductive Logic Programming community has considered proof-complexity and model-complexity, but, until recently, size-complexity has received little attention. Recently a chal...
176
click to vote
TLCA
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
144
click to vote
EUROPAR
1995
Springer
15 years 9 months ago
1995
Springer
Much work has been done in the areas of and–parallelism and data parallelism in Logic Programs. Such work has proceeded to a certain extent in an independent fashion. Both types...
174
click to vote
AAAI
2007
15 years 8 months ago
2007
A team of agents is jointly able to achieve a goal if despite any incomplete knowledge they may have about the world or each other, they still know enough to be able to get to a g...