474 research outputs found
A Preference-Based Approach to Backbone Computation with Application to Argumentation
The backbone of a constraint satisfaction problem consists of those variables that take the same value in all solutions. Algorithms for determining the backbone of propositional formulas, i.e., Boolean satisfiability (SAT) instances, find various real-world applications. From the knowledge representation and reasoning (KRR) perspective, one interesting connection is that of backbones and the so-called ideal semantics in abstract argumentation. In this paper, we propose a new backbone algorithm which makes use of a "SAT with preferences" solver, i.e., a SAT solver which is guaranteed to output a most preferred satisfying assignment w.r.t. a given preference over literals of the SAT instance at hand. We also show empirically that the proposed approach is specifically effective in computing the ideal semantics of argumentation frameworks, noticeably outperforming an other state-of-the-art backbone solver as well as the winning approach of the recent ICCMA 2017 argumentation solver competition in the ideal semantics track.Peer reviewe
Answer Set Programming Modulo `Space-Time'
We present ASP Modulo `Space-Time', a declarative representational and
computational framework to perform commonsense reasoning about regions with
both spatial and temporal components. Supported are capabilities for mixed
qualitative-quantitative reasoning, consistency checking, and inferring
compositions of space-time relations; these capabilities combine and synergise
for applications in a range of AI application areas where the processing and
interpretation of spatio-temporal data is crucial. The framework and resulting
system is the only general KR-based method for declaratively reasoning about
the dynamics of `space-time' regions as first-class objects. We present an
empirical evaluation (with scalability and robustness results), and include
diverse application examples involving interpretation and control tasks
Synthesis of Cost-Optimal Multi-Agent Systems for Resource Allocation
Multi-agent systems for resource allocation (MRAs) have been introduced as a
concept for modelling competitive resource allocation problems in distributed
computing. An MRA is composed of a set of agents and a set of resources. Each
agent has goals in terms of allocating certain resources. For MRAs it is
typically of importance that they are designed in a way such that there exists
a strategy that guarantees that all agents will achieve their goals. The
corresponding model checking problem is to determine whether such a winning
strategy exists or not, and the synthesis problem is to actually build the
strategy. While winning strategies ensure that all goals will be achieved,
following such strategies does not necessarily involve an optimal use of
resources.
In this paper, we present a technique that allows to synthesise cost-optimal
solutions to distributed resource allocation problems. We consider a scenario
where system components such as agents and resources involve costs. A
multi-agent system shall be designed that is cost-minimal but still capable of
accomplishing a given set of goals. Our approach synthesises a winning strategy
that minimises the cumulative costs of the components that are required for
achieving the goals. The technique is based on a propositional logic encoding
and a reduction of the synthesis problem to the maximum satisfiability problem
(Max-SAT). Hence, a Max-SAT solver can be used to perform the synthesis. From a
truth assignment that maximises the number of satisfied clauses of the encoding
a cost-optimal winning strategy as well as a cost-optimal system can be
immediately derived.Comment: In Proceedings FROM 2022, arXiv:2209.0920
- …