This paper presents a general strategy, bringing together some major types of nonmonotonic reasoning under a monotonic bimodal setting. Such formalisms are also of interest to the fields of knowledge representation an...
详细信息
This paper presents a general strategy, bringing together some major types of nonmonotonic reasoning under a monotonic bimodal setting. Such formalisms are also of interest to the fields of knowledge representation and declarative programming. We exemplify the methodology, capturing minimal model reasoning that underlies nonmonotonicity over S4F first, but then we also show how to apply the technique to other nonmonotonic logics respectively based on the modal logics KD45 and SW5. We naturally succeed it, by modifying only the axioms of the underlying modal logic and show that it successfully works. The last two formalisms are also known as autoepistemic logic (AEL) and its reflexive extension (RAEL) in the given order: AEL is an important form of nonmonotonic reasoning, introduced by Robert C. Moore in order to allow an agent to reason about his own knowledge. Equilibrium logic (EL) is a general-purpose nonmonotonic reasoning formalism, proposed more recently by David Pearce as a semantical framework for answer set programming (ASP). The latter is an efficient declarative problem solving approach with lots of applications to science and technology. Fariflas et al. have embedded EL (and so ASP) into a monotonic bimodal logic. We take this work as an initiative and successfully apply a similar methodology to closely aligned nonmonotonic modal logics. We finally discuss the potential capability to subsume the epistemic extensions of ASP within our unified paradigm.
We are interested in automating reasoning with and about study regulations, catering to various stakeholders, ranging from administrators, over faculty, to students at different stages. Our work builds on an extensive...
详细信息
We are interested in automating reasoning with and about study regulations, catering to various stakeholders, ranging from administrators, over faculty, to students at different stages. Our work builds on an extensive analysis of various study programs at the University of Potsdam. The conceptualization of the underlying principles provides us with a formal account of study regulations. In particular, the formalization reveals the properties of admissible study plans. With these at end, we propose an encoding of study regulations in answer set programming that produces corresponding study plans. Finally, we show how this approach can be extended to a generic user interface for exploring study plans.
Meta-Interpretive Learning (MIL) learns logic programs from examples by instantiating meta-rules, which is implemented by the Metagol system based on Prolog. Viewing MIL-problems as combinatorial search problems, they...
详细信息
Meta-Interpretive Learning (MIL) learns logic programs from examples by instantiating meta-rules, which is implemented by the Metagol system based on Prolog. Viewing MIL-problems as combinatorial search problems, they can alternatively be solved by employing answer set programming (ASP), which may result in performance gains as a result of efficient conflict propagation. However, a straightforward ASP-encoding of MIL results in a huge search space due to a lack of procedural bias and the need for grounding. To address these challenging issues, we encode MIL in the HEX-formalism, which is an extension of ASP that allows us to outsource the background knowledge, and we restrict the search space to compensate for a procedural bias in ASP. This way, the import of constants from the background knowledge can for a given type of meta-rules be limited to relevant ones. Moreover, by abstracting from term manipulations in the encoding and by exploiting the HEX interface mechanism, the import of such constants can be entirely avoided in order to mitigate the grounding bottleneck. An experimental evaluation shows promising results.
Even within a single knowledge representation system there are often many different ways to model a given domain and formalise a reasoning problem specified over the domain. In particular, two knowledge descriptions c...
详细信息
Even within a single knowledge representation system there are often many different ways to model a given domain and formalise a reasoning problem specified over the domain. In particular, two knowledge descriptions can be semantically equivalent even if they are expressed in quite different languages or vocabularies. This paper proposes and studies a concept of synonymy that applies to equivalent theories formulated in distinct vocabularies. We suggest a set of general desiderata or criteria of adequacy that any reasonable synonymy concept should satisfy. We then analyse a specific concept of synonymy within answer set programming (ASP), a framework that is currently being applied with success in many areas of knowledge technology. We characterise this concept in different ways, show that it satisfies the prescribed criteria of adequacy, and illustrate how it can be applied to a sample problem arising in knowledge representation and reasoning. As a logical framework we use quantified equilibrium logic based on a first-order version of the logic of here-and-there. This serves as an adequate formal foundation for ASP and allows us to obtain a logical account of the synonymy relation. (C) 2011 Elsevier Inc. All rights reserved.
The dominating set reconfiguration problem is defined as determining, for a given dominating set problem and two among its feasible solutions, whether one is reachable from the other via a sequence of feasible solutio...
详细信息
The dominating set reconfiguration problem is defined as determining, for a given dominating set problem and two among its feasible solutions, whether one is reachable from the other via a sequence of feasible solutions subject to a certain adjacency relation. This problem is PSPACE-complete in general. The concept of the dominating set is known to be quite useful for analyzing wireless networks, social networks, and sensor networks. We develop an approach to solve the dominating set reconfiguration problem based on answer set programming (ASP). Our declarative approach relies on a high-level ASP encoding, and both the grounding and solving tasks are delegated to an ASP-based combinatorial reconfiguration solver. To evaluate the effectiveness of our approach, we conduct experiments on a newly created benchmark set.
We introduce an approach to detecting inconsistencies in large biological networks by using answer set programming. To this end, we build upon a recently proposed notion of consistency between biochemical/genetic reac...
详细信息
We introduce an approach to detecting inconsistencies in large biological networks by using answer set programming. To this end, we build upon a recently proposed notion of consistency between biochemical/genetic reactions and high-throughput profiles of cell activity. We then present an approach based on answer set programming to check the consistency of large-scale data sets. Moreover, we extend this methodology to provide explanations for inconsistencies by determining minimal representations of conflicts. In practice, this can be used to identify unreliable data or to indicate missing reactions.
In this paper we propose an extension of answer set programming (ASP) to deal with (possibly partial) evaluable functions. To this aim, we start from the most general logical counterpart of ASP, Quantified Equilibrium...
详细信息
In this paper we propose an extension of answer set programming (ASP) to deal with (possibly partial) evaluable functions. To this aim, we start from the most general logical counterpart of ASP, Quantified Equilibrium Logic (QEL), and propose a variant QEL(F)(=) where the set of functions is partitioned into Herbrand functions (or constructors) and evaluable functions (or operations). We show how this extension has a direct connection to Scott's Logic of Existence, and introduce several useful derived operators, some of them directly borrowed from Scott's formalisation. Using this general framework for arbitrary theories, we proceed to focus on a syntactic subclass that corresponds to normal logic programs with evaluable functions and equality. We provide a translation of this class into function-free normal programs and consider a safety condition so that the resulting program is also safe, under the usual meaning in ASP. Finally, we also establish a formal comparison to Lin and Wang's approach (FASP) dealing with evaluable total functions.
answer set programming (ASP) is a popular logic programming paradigm that has been applied for solving a variety of complex problems. Among the most challenging real-world applications of ASP are two industrial proble...
详细信息
answer set programming (ASP) is a popular logic programming paradigm that has been applied for solving a variety of complex problems. Among the most challenging real-world applications of ASP are two industrial problems defined by Siemens: the Partner Units Problem (PUP) and the Combined Configuration Problem (CCP). The hardest instances of PUP and CCP are out of reach for state-of-the-art ASP solvers. Experiments show that the performance of ASP solvers could be significantly improved by embedding domain-specific heuristics, but a proper effective integration of such criteria in off-the-shelf ASP implementations is not obvious. In this paper the combination of ASP and domain-specific heuristics is studied with the goal of effectively solving real-world problem instances of PUP and CCP. As a byproduct of this activity, the ASP solver WASP was extended with an interface that eases embedding new external heuristics in the solver. The evaluation shows that our domain-heuristic-driven ASP solver finds solutions for all the real-world instances of PUP and CCP ever provided by Siemens.
Quantum Computing has become a more and more prominent research field in the last few decades. This growth in interest is mainly related to the so-called quantum speed up that some quantum procedure exhibits. The two ...
详细信息
ISBN:
(纸本)9798400706462
Quantum Computing has become a more and more prominent research field in the last few decades. This growth in interest is mainly related to the so-called quantum speed up that some quantum procedure exhibits. The two main examples are Shor and Grover algorithms. The latter will be a key ingredient of this paper. In particular, we propose an attempt to speed up answer set programming (ASP) exploiting Quantum Computing. We rely on two proposals in the literature that use quantum computation for: finding stable models of ASP programs;counting solutions of propositional formulae. For combining such proposals we embed in the quantum framework a third proposal from the literature, namely a purely classical approach for navigating the solution space of ASP models. We end up with a quantum method for counting stable models of ASP programs. After providing the details of our method, we briefly describe a Proof of Concept implementation of these techniques.
setprogramming (ASP) is a powerful paradigm based on logic programming for non-monotonic reasoning. Current ASP implementations are restricted to "grounded range-restricted function-free normal programs" an...
详细信息
setprogramming (ASP) is a powerful paradigm based on logic programming for non-monotonic reasoning. Current ASP implementations are restricted to "grounded range-restricted function-free normal programs" and use an evaluation strategy that is "bottom-up" (i.e., not goal-driven). Recent introduction of coinductive Logic programming (co-LP) with coinductive SLDNF resolution (co-SLDNF) has allowed the development of top-down query-driven goal-directed evaluation strategies for ASP. In this paper we present co-LP with co-SLDNF and its application to the implementation of a predicate ASP solver. Our novel method eliminates the need for grounding and allows functions, to overcome current restriction of current ASP solver, toward the development of a truly predicate ASP solver. The resulting coinductive ASP solver (co-ASP Solver) provides a powerful, practical and efficient predicate ASP solver to handle effectively a large class of predicate answerset programs including possibly infinite ones. We apply our solution strategy to answer programs (e.g., move-win and Schur number problem) to demonstrate our co-ASP Solver with performance result.
暂无评论