the proceedings contain 55 papers. the topics discussed include: integrating temporal extensions of answer set programming;the fourth answer set programming competition: preliminary report;WASP: a native ASP solver ba...
ISBN:
(纸本)9783642405631
the proceedings contain 55 papers. the topics discussed include: integrating temporal extensions of answer set programming;the fourth answer set programming competition: preliminary report;WASP: a native ASP solver based on constraint learning;symbolic system synthesis using answer set programming;accurate computation of sensitizable paths using answer set programming;encoding higher level extensions of Petri nets in answer set programming;Cplus2ASP: computing action language C+ in answer set programming;event-object reasoning with curated knowledge bases: deriving missing information;towards query answering in relational multi-context systems;spectra in abstract argumentation: an analysis of minimal change;an ASP application in integrative biology: identification of functional gene units;extending the metabolic network of ectocarpus siliculosus using answer set programming;and efficient approximation of well-founded justification and well-founded domination.
this volume contains the refereed proceedings of the 12th international conference on logic programming and nonmonotonic reasoning, lpnmr 2013, held in September 2013 in Corunna, Spain. the 34 revised full papers (22 ...
ISBN:
(数字)9783642405648
ISBN:
(纸本)9783642405631;9783642405648
this volume contains the refereed proceedings of the 12th international conference on logic programming and nonmonotonic reasoning, 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.
the analysis of properties of consequence operators has been a very active field in the formative years of non-monotonic reasoning. One possible approach to do this is to start with a model-theoretic semantics and the...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
the analysis of properties of consequence operators has been a very active field in the formative years of non-monotonic reasoning. One possible approach to do this is to start with a model-theoretic semantics and then to study the logical consequence relation induced by that semantics. In this paper we follow that approach and analyse resulting consequence operators of so-called characterization logics. Roughly speaking, a characterization logic characterizes, via its own notion of ordinary equivalence, another logic's notion of strong equivalence. For example, the logic of here and there is a characterization logic for answer set programs, because strong equivalence of the latter is characterized by ordinary equivalence of the former. In previous work, we showed that the consideration of finite knowledge bases only - a common assumption in the field of knowledge representation - guarantees the existence (and uniqueness) of characterization logics. In this paper, we apply this existence result to the field of abstract argumentation. We show that the associated consequence operator outputs a so-called reverse kernel, a useful construct that received comparably little attention in the literature so far. As an aside, we clarify that for several well-known logics, their canonical characterization consequence operators are well-behaved.
Turner's logic of universal causation is a general logic for nonmonotonicreasoning. It has its origin in McCain and Turner's causal action theories which have been translated to propositional logic and logic ...
详细信息
ISBN:
(纸本)9783642405648
Turner's logic of universal causation is a general logic for nonmonotonicreasoning. It has its origin in McCain and Turner's causal action theories which have been translated to propositional logic and logicprogramming with nested expressions. In this paper, we propose to do the same for Turner's logic, and show thatTurner's logic can actually be mapped to McCain and Turner's causal theories. these results can be used to construct a system for reasoning in Turner's logic.
Parametrized logic programs are very expressive logic programs that generalize normal logic programs under the stable model semantics, by allowing complex formulas of a parameter logic to appear in the body and head o...
详细信息
ISBN:
(纸本)9783642405648
Parametrized logic programs are very expressive logic programs that generalize normal logic programs under the stable model semantics, by allowing complex formulas of a parameter logic to appear in the body and head of rules. In this paper we study the decidability of these rich programs and propose an implementation that combines, in a modular way, a reasoner for the parameter logic with an answer set solver.
Within everyday reasoning we often use argumentation patterns that employ the rather vague notion of something being normally true. this form of reasoning is usually captured using Reiter's Default logic. However,...
详细信息
ISBN:
(纸本)9783642405648
Within everyday reasoning we often use argumentation patterns that employ the rather vague notion of something being normally true. this form of reasoning is usually captured using Reiter's Default logic. However, in Default logic one has to make explicit the rules which are to be used for reasoning and which are supposed to be normally true. this is a bit contrary to the everyday situation where people use experience to decide what normally follows from particular observations and what not, not using any kind of logical rules at all. To formalize this kind of reasoning we propose an approach which is based on prior experiences, using the fact that something follows normally if this is the case for "almost all" of the available experience.
In recent work, we provided a formulation of ASP programs in terms of linear logictheories. Based on this work, in this paper we propose and discuss a modified Answer Set Semantics, "Resource-based Answer Set Se...
详细信息
ISBN:
(纸本)9783642405648
In recent work, we provided a formulation of ASP programs in terms of linear logictheories. Based on this work, in this paper we propose and discuss a modified Answer Set Semantics, "Resource-based Answer Set Semantics".
In this paper we present a technique based on logicprogramming for data cleaning, and its application to a real use case from the Italian Healthcare System. the use case is part of a more complex project developing a...
详细信息
ISBN:
(纸本)9783642405648
In this paper we present a technique based on logicprogramming for data cleaning, and its application to a real use case from the Italian Healthcare System. the use case is part of a more complex project developing a business intelligence suite for the analysis of distributed archives of tumor-based diseases.
It has been known for a long time that intuitionistically equivalent formulas have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions and disjunctions and show h...
详细信息
ISBN:
(纸本)9783642405648
It has been known for a long time that intuitionistically equivalent formulas have the same stable models. We extend this theorem to propositional formulas with infinitely long conjunctions and disjunctions and show how to apply this generalization to proving properties of aggregates in answer set programming.
暂无评论