answer set programming (ASP) is a paradigm for modeling knowledge-intensive domains and solving challenging reasoning problems. In ASP solving, a typical strategy is to preprocess problem instances by rewriting comple...
详细信息
answer set programming (ASP) is a paradigm for modeling knowledge-intensive domains and solving challenging reasoning problems. In ASP solving, a typical strategy is to preprocess problem instances by rewriting complex rules into simpler ones. Normalization is a rewriting process that removes extended rule types altogether in favor of normal rules. Recently, such techniques led to optimization rewriting in ASP, where the goal is to boost answerset optimization by refactoring the optimization criteria of interest. In this paper, we present a novel, general, and effective technique for optimization rewriting based on comparator networks which are specific kinds of circuits for reordering the elements of vectors. The idea is to connect an ASP encoding of a comparator network to the literals being optimized and to redistribute the weights of these literals over the structure of the network. The encoding captures information about the weight of an answerset in auxiliary atoms in a structured way that is proven to yield exponential improvements during branch-and-bound optimization on an infinite family of example programs. The used comparator network can be tuned freely, for example, to find the best size for a given benchmark class. Experiments show accelerated optimization performance on several benchmark problems.
Qualitative formalisms offer a well-established alternative to the more traditionally used differential equation models of Biological Regulatory Networks (BRNs). These formalisms led to numerous theoretical works and ...
详细信息
Qualitative formalisms offer a well-established alternative to the more traditionally used differential equation models of Biological Regulatory Networks (BRNs). These formalisms led to numerous theoretical works and practical tools to understand emerging behaviors. The analysis of the dynamics of very large models is however a rather hard problem, which led us to previously introduce the Process Hitting framework (PH), which is a particular class of nondeterministic asynchronous automata network (or safe Petri nets). Its major advantage lies in the efficiency of several static analyses recently designed to assess dynamical properties, making it possible to tackle very large models. In this paper, we address the formal identification of qualitative models of BRNs from PH models. First, the inference of the Interaction Graph from a PH model summarizes the signed influences between the components that are effective for the dynamics. Second, we provide the inference of all Rene Thomas models of BRNs that are compatible with a given PH. As the PH allows the specification of nondeterministic interactions between components, our inference emphasizes the ability of PH to deal with large BRNs with incomplete knowledge on interactions, where Thomas' approach fails because of the combinatorics of parameters. The inference of corresponding Thomas models is implemented using answer set programming, which allows in particular an efficient enumeration of (possibly numerous) compatible parameterizations. (C) 2014 Elsevier B.V. All rights reserved.
We introduce novel mathematical models and algorithms to generate (shortest or k different) explanations for biomedical queries, using answer set programming. We implement these algorithms and integrate them in BIOQUE...
详细信息
We introduce novel mathematical models and algorithms to generate (shortest or k different) explanations for biomedical queries, using answer set programming. We implement these algorithms and integrate them in BIOQUERY-ASP. We illustrate the usefulness of these methods with some complex biomedical queries related to drug discovery, over the biomedical knowledge resources PHARMGKB, DRUGBANK, BIOGRID, CTD, SIDER, DISEASE ONTOLOGY, and ORPHADATA.
Unlike conventional rule based knowledge bases (KBs) that support monotonic reasoning, a key correctness issue, i.e. the correctness of a sub-KB with respect to the full KB, arises when using a KB represented by non-m...
详细信息
Unlike conventional rule based knowledge bases (KBs) that support monotonic reasoning, a key correctness issue, i.e. the correctness of a sub-KB with respect to the full KB, arises when using a KB represented by non-monotonic reasoning languages such as answer set programming (ASP). Since a user may have rights to access only a subset of a KB, the non-monotonic nature of ASP may cause the occurrence of consequences, which are erroneous in the sense that the consequences are not reasonable in the full KB. This paper proposes an approach dealing with the problem. The main idea is to let the usage of Closed World Assumptions (CWAs) for literals in a KB satisfy certain constraints. Two kinds of access right propositions are created, rule retrieval right propositions to control the access to rules, and CWA right propositions to control the usage of CWAs for literals. Based on these right propositions, this paper first defines an algorithm for translating an original KB into a KB tagged by right propositions, and then discusses the right dependency in a KB and proposes methods for checking and obtaining a set of rights that is closed under a set of dependency rules. Finally, several results on the correctness of a set of rights in a KB are presented, which serve as guidelines for the correct use of a KB. As an example, a KB of illness-related financial support for teachers of a university is presented to illustrate the application of our approach. (C) 2010 Elsevier B.V. All rights reserved.
The paper introduces the notion of offline justification for answer set programming (ASP). Justifications provide a graph-based explanation of the truth value of an atom with respect to a given answerset. The paper e...
详细信息
The paper introduces the notion of offline justification for answer set programming (ASP). Justifications provide a graph-based explanation of the truth value of an atom with respect to a given answerset. The paper extends also this notion to provide justification of atoms during the computation of an answerset (on-line justification) and presents an integration of online justifications within the computation model Of SMODELS. Offline and online justifications provide useful tools to enhance understanding of ASP, and they offer a basic data structure to support methodologies and tools for debugging answerset programs. A preliminary implementation has been developed in ASP - PROLOG.
We investigate the role of symmetry detection and symmetry breaking in answer set programming to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We reduce symmetry detection ...
详细信息
We investigate the role of symmetry detection and symmetry breaking in answer set programming to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We reduce symmetry detection to a graph automorphism problem which allows us to extract symmetries of a logic program from the symmetries of the constructed coloured graph. The correctness of our reduction is proven. We also propose an encoding of symmetry-breaking constraints in terms of permutation cycles and use only generators in this process to implicitly represent symmetries with exponential compression. These ideas are formulated as preprocessing and implemented in a completely automated flow that first detects symmetries from a given answerset program, adds symmetry-breaking constraints, and can be applied to any existing answerset solver. We demonstrate computational impact on benchmarks versus direct application of the solver.
Fuzzy answer set programming (FASP) is a recent formalism for knowledge representation that enriches the declarativity of answer set programming by allowing propositions to be graded. To now, no implementations of FAS...
详细信息
Fuzzy answer set programming (FASP) is a recent formalism for knowledge representation that enriches the declarativity of answer set programming by allowing propositions to be graded. To now, no implementations of FASP solvers are available and all current proposals are based on compilations of logic programs into different paradigms, like mixed integer programs or bilevel programs. These approaches introduce many auxiliary variables which might affect the performance of a solver negatively. To limit this downside, operators for approximating fuzzy answersets can be introduced: Given a FASP program, these operators compute lower and upper bounds for all atoms in the program such that all answersets are between these bounds. This paper analyzes several operators of this kind which are based on linear programming, fuzzy unfounded sets and source pointers. Furthermore, the paper reports on a prototypical implementation, also describing strategies for avoiding computations of these operators when they are guaranteed to not improve current bounds. The operators and their implementation can be used to obtain more constrained mixed integer or bilevel programs, or even for providing a basis for implementing a native FASP solver. Interestingly, the semantics of relevant classes of programs with unique answersets, like positive programs and programs with stratified negation, can be already computed by the prototype without the need for an external tool.
Boolean games are a framework for reasoning about the rational behavior of agents whose goals are formalized using propositional formulas. Compared to normal form games, a well-studied and related game framework, Bool...
详细信息
Boolean games are a framework for reasoning about the rational behavior of agents whose goals are formalized using propositional formulas. Compared to normal form games, a well-studied and related game framework, Boolean games allow for an intuitive and more compact representation of the agents' goals. So far, Boolean games have been mainly studied in the literature from the Knowledge Representation perspective, and less attention has been paid on the algorithmic issues underlying the computation of solution concepts. Although some suggestions for solving specific classes of Boolean games have been made in the literature, there is currently no work available on the practical performance. In this paper, we propose the first technique to solve general Boolean games that does not require an exponential translation to normal-form games. Our method is based on disjunctive answer set programming and computes solutions (equilibria) of arbitrary Boolean games. It can be applied to a wide variety of solution concepts, and can naturally deal with extensions of Boolean games such as constraints and costs. We present detailed experimental results in which we compare the proposed method against a number of existing methods for solving specific classes of Boolean games, as well as adaptations of methods that were initially designed for normal-form games. We found that the heuristic methods that do not require all payoff matrix entries performed well for smaller Boolean games, while our ASP based technique is faster when the problem instances have a higher number of agents or action variables.
Temporal logics are well suited for reasoning about actions, as they allow for the specification of domain descriptions including temporal constraints as well as for the verification of temporal properties. The articl...
详细信息
Temporal logics are well suited for reasoning about actions, as they allow for the specification of domain descriptions including temporal constraints as well as for the verification of temporal properties. The article deals with verification of action theories defined in a temporal extension of answer set programming which combines ASP with a dynamic linear time temporal logic (DLTL). The article proposes an approach to bounded model checking that exploits the Buchi automaton construction while searching for a counterexample, with the aim of achieving completeness. The article provides an encoding in ASP of the temporal action domains and of Bounded Model Checking of DLTL formulas. The article also deals with reasoning about epistemic knowledge and incomplete states.
This note presents a historical survey of informal semantics that are associated with logic programming under answerset semantics. We review these in uniform terms and align them with two paradigms: answerset Progra...
详细信息
This note presents a historical survey of informal semantics that are associated with logic programming under answerset semantics. We review these in uniform terms and align them with two paradigms: answer set programming and ASP-Prolog - two prominent Knowledge Representation and Reasoning Paradigms in Artificial Intelligence.
暂无评论