167 search results - page 15 / 34 » Possibilistic-Based Argumentation: An Answer Set Programming... |
114
click to vote
CP
2007
Springer
15 years 9 months ago
2007
Springer
Defence trees and CP-net (ceteris paribus network) are two useful approaches that can be used to help a system administrator to analyze a security scenario and to give him a model ...
122
Voted
PVM
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This paper presents the concept of parallelisation of a solver for Answer Set Programming (ASP). While there already exist some approaches to parallel ASP solving, there ...
155
Voted
ATAL
2008
Springer
15 years 5 months ago
2008
Springer
In order to obtain semantic interoperability in open MultiAgent Systems, agents need to agree on the basis of different ontologies. In this paper we formally define mapping as cor...
117
Voted
LPNMR
2009
Springer
15 years 10 months ago
2009
Springer
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...
137
click to vote
LPNMR
2005
Springer
15 years 9 months ago
2005
Springer
Equilibrium logic, introduced by David Pearce, extends the concept of an answer set from logic programs to arbitrary sets of formulas. Logic programs correspond to the special case...