840 search results - page 37 / 168 » A low-complexity issue logic |
125
Voted
DALT
2009
Springer
15 years 3 months ago
2009
Springer
We propose a framework to compute the utility of a proposal w.r.t. a preference set in a negotiation process. In particular, we refer to preferences expressed as weighted formulas ...
COLING
2002
15 years 9 days 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...
CORR
2002
Springer
15 years 9 days 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...
112
Voted
TLCA
2005
Springer
15 years 6 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. ...
94
Voted
EUROPAR
1995
Springer
15 years 4 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...