Symmetry Breaking for Distributed Multi-Context Systems

DOI10.1007/978-3-642-20895-9_5zbMATH Open1327.68247arXiv1104.3931OpenAlexW1538403283WikidataQ57549106 ScholiaQ57549106MaRDI QIDQ3003240FDOQ3003240

Thomas Krennwallner, Christian Drescher, Michael Fink, Thomas Eiter, Toby Walsh

Publication date: 26 May 2011

Published in: Logic Programming and Nonmonotonic Reasoning (Search for Journal in Brave)

Abstract: Heterogeneous nonmonotonic multi-context systems (MCS) permit different logics to be used in different contexts, and link them via bridge rules. We investigate the role of symmetry detection and symmetry breaking in such systems to eliminate symmetric parts of the search space and, thereby, simplify the evaluation process. We propose a distributed algorithm that takes a local stance, i.e., computes independently the partial symmetries of a context and, in order to construct potential symmetries of the whole, combines them with those partial symmetries returned by neighbouring contexts. We prove the correctness of our methods. We instantiate such symmetry detection and symmetry breaking in a multi-context system with contexts that use answer set programs, and demonstrate computational benefit on some recently proposed benchmarks.

Full work available at URL: https://arxiv.org/abs/1104.3931

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic programming (68N17) Logic in artificial intelligence (68T27) Distributed algorithms (68W15) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Cited In (2)

• Title not available (Why is that?)
• Title not available (Why is that?)

Uses Software

• clasp

This page was built for publication: Symmetry Breaking for Distributed Multi-Context Systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3003240)