565 search results - page 83 / 113 » Extending Answer Sets for Logic Programming Agents |
140
Voted
AMAI
2004
Springer
15 years 3 months ago
2004
Springer
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independ...
105
Voted
CSL
2009
Springer
15 years 10 months ago
2009
Springer
We develop a polarised variant of Curien and Herbelin’s ¯λµ˜µ calculus suitable for sequent calculi that admit a focalising cut elimination (i.e. whose proofs are focalised ...
125
Voted
DAC
2001
ACM
16 years 4 months ago
2001
ACM
New application-focused system-on-chip platforms motivate new application-specific processors. Configurable and extensible processor architectures offer the efficiency of tuned lo...
154
Voted
DKE
2008
15 years 3 months ago
2008
In this work, we present the design and implementation of a system for proof explanation in the Semantic Web, based on defeasible reasoning. Trust is a vital feature for Semantic ...
107
click to vote
ICLP
2010
Springer
15 years 7 months ago
2010
Springer
hex programs were originally introduced as a general framework for extending declarative logic programming, under the stable model semantics, with the possibility of bidirectional...