We describe eclingo, a solver for epistemic logic programs under Gelfond 1991 semantics built upon the Answer Set programming system clingo. the input language of eclingo uses the syntax extension capabilities of clin...
详细信息
We describe eclingo, a solver for epistemic logic programs under Gelfond 1991 semantics built upon the Answer Set programming system clingo. the input language of eclingo uses the syntax extension capabilities of clingo to define subjective literals that, as usual in epistemic logic programs, allow for checking the truth of a regular literal in all or in some of the answer sets of a program. the eclingo solving process follows a guess and check strategy. It first generates potential truth values for subjective literals and, in a second step, it checks the obtained result with respect to the cautious and brave consequences of the program. this process is implemented using the multi-shot functionalities of clingo. We have also implemented some optimisations, aiming at reducing the search space and, therefore, increasing eclingo 's efficiency in some scenarios. Finally, we compare the efficiency of eclingo with two state-of-the-art solvers for epistemic logic programs on a pair of benchmark scenarios and show that eclingo generally outperforms their obtained results.
reasoning about gene networks is essential from various perspectives, such as predicting side effects of drugs or explaining unusual cellular behavior. Because of the massive size of these gene networks, a biologist c...
详细信息
We describe eclingo, a solver for epistemic logic programs under Gelfond 1991 semantics built upon the Answer Set programming system clingo. the input language of eclingo uses the syntax extension capabilities of clin...
详细信息
We describe eclingo, a solver for epistemic logic programs under Gelfond 1991 semantics built upon the Answer Set programming system clingo. the input language of eclingo uses the syntax extension capabilities of clingo to define subjective literals that, as usual in epistemic logic programs, allow for checking the truth of a regular literal in all or in some of the answer sets of a program. the eclingo solving process follows a guess and check strategy. It first generates potential truth values for subjective literals and, in a second step, it checks the obtained result with respect to the cautious and brave consequences of the program. this process is implemented using the multi-shot functionalities of clingo. We have also implemented some optimisations, aiming at reducing the search space and, therefore, increasing eclingo 's efficiency in some scenarios. Finally, we compare the efficiency of eclingo with two state-of-the-art solvers for epistemic logic programs on a pair of benchmark scenarios and show that eclingo generally outperforms their obtained results.
In a variety of reasoning tasks, one estimates the likelihood of events by means of volumes of sets they define. Such sets need to be measurable, which is usually achieved by putting bounds, sometimes ad hoc, on them....
详细信息
ISBN:
(纸本)9780999241172
In a variety of reasoning tasks, one estimates the likelihood of events by means of volumes of sets they define. Such sets need to be measurable, which is usually achieved by putting bounds, sometimes ad hoc, on them. We address the question how unbounded or unmeasurable sets can be measured nonetheless. Intuitively, we want to know how likely a randomly chosen point is to be in a given set, even in the absence of a uniform distribution over the entire space. To address this, we follow a recently proposed approach of taking intersection of a set with balls of increasing radius, and defining the measure by means of the asymptotic behavior of the proportion of such balls taken by the set. We show that this approach works for every set definable in first-order logic withthe usual arithmetic over the reals (addition, multiplication, exponentiation, etc.), and every uniform measure over the space, of which the usual Lebesgue measure (area, volume, etc.) is an example. In fact we establish a correspondence between the good asymptotic behavior and the finiteness of the VC dimension of definable families of sets. Towards computing the measure thus defined, we show how to avoid the asymptotics and characterize it via a specific subset of the unit sphere. Using definability of this set, and known techniques for sampling from the unit sphere, we give two algorithms for estimating our measure of unbounded unmeasurable sets, with deterministic and probabilistic guarantees, the latter being more efficient. Finally we show that a discrete analog of this measure exists and is similarly well-behaved.
We present xclingo, a tool for generating explanations from ASP programs annotated with text and labels. these annotations allow tracing the application of rules or the atoms derived by them. the input of xclingo is a...
详细信息
We present xclingo, a tool for generating explanations from ASP programs annotated with text and labels. these annotations allow tracing the application of rules or the atoms derived by them. the input of xclingo is a markup language written as ASP comment lines, so the programs annotated in this way can still be accepted by a standard ASP solver. xclingo translates the annotations into additional predicates and rules and uses the ASP solver clingo to obtain the extension of those auxiliary predicates. this information is used afterwards to construct derivation trees containing textual explanations. the language allows selecting which atoms to explain and, in its turn, which atoms or rules to include in those explanations. We illustrate the basic features through a diagnosis problem from the literature.
Answer Set programming (ASP) has become the paradigm of choice in the field of logicprogramming and non-monotonicreasoning. Withthe design of new and efficient solvers, ASP has been successfully adopted in a wide r...
详细信息
Epistemic logic programs constitute an extension of the stable model semantics to deal with new constructs called subjective literals. Informally speaking, a subjective literal allows checking whether some objective l...
详细信息
the proceedings contain 38 papers. the special focus in this conference is on Multi-Agent Systems. the topics include: Predicting the Winners of Borda, Kemeny and Dodgson Elections with Supervised Machine Learning;fro...
ISBN:
(纸本)9783030664114
the proceedings contain 38 papers. the special focus in this conference is on Multi-Agent Systems. the topics include: Predicting the Winners of Borda, Kemeny and Dodgson Elections with Supervised Machine Learning;from Virtual Worlds to Mirror Worlds: A Model and Platform for Building Agent-Based eXtended Realities;decentralised Multi-intersection Congestion Control for Connected Autonomous Vehicles;Model-Checking Information Diffusion in Social Networks with PRISM;"Roads? Where We’re Going We Don’t Need Roads." Using Agent-Based Modeling to Analyze the Economic Impact of Hyperloop Introduction on a Supply Chain;sensitivity to Initial Conditions in Agent-Based Models;statecharts and Agent Technology: the Past and Future;a Game of Double Agents: Repeated Stackelberg Games with Role Switch;learning Summarised Messaging through Mediated Differentiable Inter-Agent Learning;integrating Deep Learning and non-monotoniclogical reasoning for Explainable Visual Question Answering;multiagent Task Coordination as Task Allocation Plus Task Responsibility;anytime and Efficient Coalition Formation with Spatial and Temporal Constraints;congestion Management for Mobility-on-Demand Schemes that Use Electric Vehicles;disaster Response Simulation as a Testbed for Multi-Agent Systems;rewarding Miners: Bankruptcy Situations and Pooling Strategies;a Game-theoretical Analysis of Charging Strategies for Competing Double Auction Marketplaces;agents for Preserving Privacy: Learning and Decision Making Collaboratively;open Social Systems;preface;towards a theory of Intentions for Human-Robot Collaboration;a Faithful Mechanism for Privacy-Sensitive Distributed Constraint Satisfaction Problems;incentivising Exploration and Recommendations for Contextual Bandits with Payments;emotional Agents Make a (Bank) Run;An Interface for programming Verifiable Autonomous Agents in ROS;combining Lévy Walks and Flocking for Cooperative Surveillance Using Aerial Swarms.
Epistemic logic Programs (ELPs) extend Answer Set programming (ASP) with epistemic negation and have received renewed interest in recent years. this led to the development of new research and efficient solving systems...
详细信息
Epistemic logic Programs (ELPs) extend Answer Set programming (ASP) with epistemic negation and have received renewed interest in recent years. this led to the development of new research and efficient solving systems for ELPs. In practice, ELPs are often written in a modular way, where each module interacts with other modules by accepting sets of facts as input, and passing on sets of facts as output. An interesting question then presents itself: under which conditions can such a module be replaced by another one without changing the outcome, for any set of input facts? this problem is known as uniform equivalence, and has been studied extensively for ASP. For ELPs, however, such an investigation is, as of yet, missing. In this paper, we therefore propose a characterization of uniform equivalence that can be directly applied to the language of state-of-the-art ELP solvers. We also investigate the computational complexity of deciding uniform equivalence for two ELPs, and show that it is on the third level of the polynomial hierarchy.
In the last years, abstract argumentation has met with great success in AI, since it has served to capture several non-monotoniclogics for AI. Relations between argumentation framework (AF) semantics and logic progra...
详细信息
In the last years, abstract argumentation has met with great success in AI, since it has served to capture several non-monotoniclogics for AI. Relations between argumentation framework (AF) semantics and logicprogramming ones are investigating more and more. In particular, great attention has been given to the well-known stable extensions of an AF, that are closely related to the answer sets of a logic program. However, if a framework admits a small incoherent part, no stable extension can be provided. To overcome this shortcoming, two semantics generalizing stable extensions have been studied, namely semi-stable and stage. In this paper, we show that another perspective is possible on incoherent AFs, called paracoherent extensions, as they have a counterpart in paracoherent answer set semantics. We compare this perspective with semi-stable and stage semantics, by showing that computational costs remain unchanged, and moreover an interesting symmetric behaviour is maintained.
暂无评论