the proceedings contain 48 papers. the special focus in this conference is on logicprogramming and nonmonotonicreasoning. the topics include: Stable models for temporal theories;algorithmic decision theory meets log...
ISBN:
(纸本)9783319232638
the proceedings contain 48 papers. the special focus in this conference is on logicprogramming and nonmonotonicreasoning. the topics include: Stable models for temporal theories;algorithmic decision theory meets logic;relational and semantic data mining;shift design with answer set programming;advances in WASP;improving coordinated SMT-based system synthesis by utilizing domain-specific heuristics;integrating ASP into ROS for reasoning in robots;automated inference of rules with exception from past legal cases using ASP;solving constraint satisfaction problems with answer set programming;a theory of intentions for intelligent agents;answer set programming modulo acyclicity;a framework for goal-directed query evaluation with negation;implementing preferences with asprin;diagnosing automatic whitelisting for dynamic remarketing ads using hybrid ASP;performance tuning in answer set programming;enablers and inhibitors in causal justifications of logic programs;efficient problem solving on tree decompositions using binary decision diagrams;knowledge acquisition via non-monotonic reasoning in distributed heterogeneous environments;a formal theory of justifications;a new computational logic approach to reason with conditionals;interactive debugging of non-ground ASP programs;linking open-world knowledge bases using nonmonotonic rules;ASP, amalgamation, and the conceptual blending workflow;diagnostic reasoning for robotics using action languages;connecting object-oriented and logicprogramming;reasoning with forest logic programs using fully enriched automata;ASP solving for expanding universes and combining heuristics for configuration problems using answer set programming;infinitary equilibrium logic and strong equivalence and compacting boolean formulae for inference in probabilistic logicprogramming.
this volume contains the refereed proceedings of the 13thinternationalconference on logicprogramming and nonmonotonicreasoning, lpnmr 2015, held in September 2015 in Lexington, KY, USA. the 290long and 11 short pa...
ISBN:
(数字)9783319232645
ISBN:
(纸本)9783319232638;9783319232645
this volume contains the refereed proceedings of the 13thinternationalconference on logicprogramming and nonmonotonicreasoning, lpnmr 2015, held in September 2015 in Lexington, KY, USA. the 290long and 11 short papers presented together with 3 invited talks, the paper reporting on the Answer Set programming competition, and four papers presented by lpnmr student attendees at the doctoral consortium were carefully reviewed and selected from 60 submissions. lpnmr is a forum for exchanging ideas on declarative logicprogramming, nonmonotonicreasoning, and knowledge representation. the aim of the lpnmrconferences is to facilitate interactions between researchers interested in the design and implementation of logic-based programming languages and database systems, and researchers who work in the areas of knowledge representation and nonmonotonicreasoning.
Model-based Diagnosis (MBD) is an approach to diagnosis, where an (objective) model of a system is diagnosed to find a set of explanations revealing root causes for issues. Temporal behavioral models are prominent app...
详细信息
ISBN:
(纸本)9783031157073;9783031157066
Model-based Diagnosis (MBD) is an approach to diagnosis, where an (objective) model of a system is diagnosed to find a set of explanations revealing root causes for issues. Temporal behavioral models are prominent approach for temporal MBD, where their associated temporal formulas (TBFs) by Brusoni et al. (Artificial Intelligence, 102:39-79, 1998) can be used to relate explanations to observations under temporal constraints based on Allen's Interval Algebra (IA). Due to expressive limitations of the constructs, we envision an extended language of TBFs that allows for complex formulas and nesting of formulas in temporal constraints. To this end, we present a language that extends propositional resp. FO logic with IA relations and provide semantics for it based on here-and-there (HT) logic as well as on Equilibrium logic. Furthermore, we lift a well-known tableau calculus for propositional HT logic to the temporal setting and report about an experimental prototype implementation. Based on these results, rich notions of diagnostic explanations from temporal behavior models may be developed.
Sequent-type proof systems constitute an important and widely-used class of calculi well-suited for analysing proof search. In this paper, we introduce a sequent-type calculus for a variant of default logic employing ...
详细信息
ISBN:
(纸本)9783030205287;9783030205270
Sequent-type proof systems constitute an important and widely-used class of calculi well-suited for analysing proof search. In this paper, we introduce a sequent-type calculus for a variant of default logic employing Lukasiewicz's three-valued logic as the underlying base logic. this version of default logic has been introduced by Radzikowska addressing some representational shortcomings of standard default logic. More specifically, our calculus axiomatises brave reasoning for this version of default logic, following the sequent method first introduced in the context of nonmonotonicreasoning by Bonatti, which employs a complementary calculus for axiomatising invalid formulas, taking care of expressing the consistency condition of defaults.
Answer set programming with graded modality (ASP(GM)) introduced in [6] provides an intuitive way for expressing modal concepts "at least as many as......" as well as "at most as many as......", an...
详细信息
ISBN:
(纸本)9783319616605;9783319616599
Answer set programming with graded modality (ASP(GM)) introduced in [6] provides an intuitive way for expressing modal concepts "at least as many as......" as well as "at most as many as......", and defaults. this paper studies the semantics of ASP(GM) and investigates its connection to the most recent language of epistemic specification (ASP(KM)) proposed in [3] and the answer set programming with epistemic negation (ASP(NOT)) presented in [5]. Particularly, we define a new approach to evaluating graded modalities in ASP(GM) such that ASP(GM) is compatible with ASP(KM) as well as ASP(NOT) at the semantic level.
We address the problem of belief revision of logic programs (LPs), i.e., how to incorporate to a LP P a new LP Q. Based on the structure of SE interpretations, Delgrande et al. (2008. Proc. of the 11thinternational C...
详细信息
We address the problem of belief revision of logic programs (LPs), i.e., how to incorporate to a LP P a new LP Q. Based on the structure of SE interpretations, Delgrande et al. (2008. Proc. of the 11thinternationalconference on Principles of Knowledge Representation and reasoning (KR'08), 411-421;2013b. Proc. of the 12thinternationalconference on logicprogramming and nonmonotonicreasoning (lpnmr'13), 264-276) adapted the well-known AGM framework (Alchourron et al. 1985. Journal of Symbolic logic 50, 2, 510-530) to LP revision. they identified the rational behavior of LP revision and introduced some specific operators. In this paper, a constructive characterization of all rational LP revision operators is given in terms of orderings over propositional interpretations with some further conditions specific to SE interpretations. It provides an intuitive, complete procedure for the construction of all rational LP revision operators and makes easier the comprehension of their semantic and computational properties. We give a particular consideration to LPs of very general form, i.e., the generalized logic programs (GLPs). We show that every rational GLP revision operator is derived from a propositional revision operator satisfying the original AGM postulates. Interestingly, the further conditions specific to GLP revision are independent from the propositional revision operator on which a GLP revision operator is based. Taking advantage of our characterization result, we embed the GLP revision operators into structures of Boolean lattices, that allow us to bring to light some potential weaknesses in the adapted AGM postulates. To illustrate our claim, we introduce and characterize axiomatically two specific classes of (rational) GLP revision operators which arguably have a drastic behavior. We additionally consider two more restricted forms of LPs, i.e., the disjunctive logic programs (DLPs) and the normal logic programs (NLPs) and adapt our characterization result t
My work on PhD thesis consists in nonmonotonicreasoning about spatial relations and how they change in time. Although there are several approaches concerning this topic, to the best of my knowledge, there is no gener...
详细信息
Answer Set programming (ASP) is a well-known paradigm of declarative programming with roots in logicprogramming and non-monotonic reasoning. Similar to other closely-related problemsolving technologies, such as SAT/S...
详细信息
暂无评论