Answer set programming (ASP) is a declarative programming paradigm stemming from logicprogrammingthat has been successfully applied in various domains. Despite amazing advancements in ASP solving, many applications ...
详细信息
ISBN:
(纸本)9783642405648
Answer set programming (ASP) is a declarative programming paradigm stemming from logicprogrammingthat has been successfully applied in various domains. Despite amazing advancements in ASP solving, many applications still pose a challenge that is commonly referred to as grounding bottleneck. Devising, implementing, and evaluating a method that alleviates this problem for certain application domains is the focus of this paper. the proposed method is based on combining backtracking-based search algorithms employed in answer set solvers with SLDNF resolution from PROLOG. Using PROLOG inference on non-ground portions of a given program, both grounding time and the size of the ground program can be substantially reduced.
the causal logic from (Bochman 2003b) is shown to provide a natural logical basis for logicprogramming. More exactly, it is argued that any logic program can be seen as a causal theory satisfying the Negation As Defa...
详细信息
We introduce a logic for knowledge representation and reasoning on protein-protein interactions. Modulo a theory, formulas describe protein structures and dynamic changes. they can be composed in order to add or remov...
详细信息
We introduce a logic for knowledge representation and reasoning on protein-protein interactions. Modulo a theory, formulas describe protein structures and dynamic changes. they can be composed in order to add or remove static and dynamic observations. A second-order circumscription operator then enables nonmonotonicreasoning on the changes implied by a formula. We introduce deduction rules that produce formulas which are, up to equivalence, in a first-order fragment with decidable satisfiability and validity. Importantly, the rules can produce circumscribed formulas.
Over recent years, various semantics have been proposed for dealing with updates in the setting of logic programs. the availability of different semantics naturally raises the question of which are most adequate to mo...
详细信息
nonmonotonic description logic programs are a major formalism for a loose coupling of rules and ontologies, formalized in logicprogramming and description logics, respectively. While this approach is attractive for c...
详细信息
We describe a method for abbreviating an analytic classical first-order logic by the introduction of a lemma. Our is based on first computing a compressed representation of present in the analytic proof and then a cut...
详细信息
ISBN:
(纸本)9783642287176
We describe a method for abbreviating an analytic classical first-order logic by the introduction of a lemma. Our is based on first computing a compressed representation of present in the analytic proof and then a cut-formula that
the Nurse Scheduling problem (NSP) is a combinatorial problem that consists of assigning nurses to shifts according to given practical constraints. In previous years, several approaches have been proposed to solve dif...
详细信息
ISBN:
(纸本)9783319616605;9783319616599
the Nurse Scheduling problem (NSP) is a combinatorial problem that consists of assigning nurses to shifts according to given practical constraints. In previous years, several approaches have been proposed to solve different variants of the NSP. In this paper, an ASP encoding for one of these variants is presented, whose requirements have been provided by an Italian hospital. We also design a second encoding for the computation of "optimal" schedules. Finally, an experimental analysis has been conducted on real data provided by the Italian hospital using both encodings. Results are very positive: the state-of-the-art ASP system CLINGO is able to compute one year schedules in few minutes, and it scales well even when more than one hundred nurses are considered.
this volume contains the refereed proceedings of the 12thinternationalconference on logicprogramming and nonmonotonicreasoning, LPNMR 2013, held in September 2013 in Corunna, Spain. the 34 revised full papers (22 ...
详细信息
ISBN:
(数字)9783642405648
ISBN:
(纸本)9783642405631
this volume contains the refereed proceedings of the 12thinternationalconference on logicprogramming and nonmonotonicreasoning, LPNMR 2013, held in September 2013 in Corunna, Spain. the 34 revised full papers (22 technical papers, 9 application description, and 3 system descriptions) and 19 short papers (11 technical papers, 3 application descriptions, and 5 system descriptions) presented together with 2 invited talks, were carefully reviewed and selected from 91 submissions. Being a forum for exchanging ideas on declarative logicprogramming, nonmonotonicreasoning, and knowledge representation, the conference aims to facilitate interactions between those researchers and practitioners interested in the design and implementation of logic-based programming languages and database systems, and those who work in the area of knowledge representation and nonmonotonicreasoning.
this paper motivates and presents a nonmonotonic version of Contextual Intensional logic, a type-theoretic logic intended as a general formalism for reasoning about context. In developing this logic, it is necessary t...
详细信息
In this paper we present STeLP, a solver for Answer Set programming with temporal operators. Taking as an input a particular kind of logic program with modal operators (called Splitable Temporal logic Program), STeLP ...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
In this paper we present STeLP, a solver for Answer Set programming with temporal operators. Taking as an input a particular kind of logic program with modal operators (called Splitable Temporal logic Program), STeLP obtains its set of temporal equilibrium models (a generalisation of stable models for this extended syntax). the obtained set of models is represented in terms of a deterministic Buchi automaton capturing the complete program behaviour. In small examples, this automaton can be graphically displayed in a direct and readable way. the input language provides a set of constructs which allow a simple definition of temporal logic programs, including a special syntax for action domains that can be exploited to simplify the graphical output. STeLP combines the use of a standard ASP solver with a linear temporal logic model checker in order to find all models of the input theory.
暂无评论