the proceedings contain 25 papers. the special focus in this conference is on logicprogramming and nonmonotonicreasoning. the topics include: Founded World Views with Autoepistemic Equilibrium logic;towards Dynamic ...
ISBN:
(纸本)9783030205270
the proceedings contain 25 papers. the special focus in this conference is on logicprogramming and nonmonotonicreasoning. the topics include: Founded World Views with Autoepistemic Equilibrium logic;towards Dynamic Answer Set programming over Finite Traces;a Sequent-Type Calculus for three-Valued Default logic, Or: Tweety Meets Quartum Non Datur;diagnosing Data Pipeline Failures Using Action Languages;repair-Based Degrees of Database Inconsistency;elect: An Inconsistency Handling Approach for Partially Preordered Lightweight Ontologies;Elaboration Tolerant Representation of Markov Decision Process via Decision-theoretic Extension of Probabilistic Action Language pBC+;Evaluation of Disjunctive Programs in WASP;telingo = ASP + Time;Telco Network Inventory Validation with NoHR;verifying Strong Equivalence of Programs in the Input Language of gringo;the Return of xorro;Degrees of Laziness in Grounding: Effects of Lazy-Grounding Strategies on ASP Solving;Enhancing DLV for Large-Scale reasoning;Pruning External Minimality Checking for ASP Using Semantic Dependencies;declarative Local Search for Predicate logic;An ASP-Based Framework for the Manipulation of Articulated Objects Using Dual-Arm Robots;C-ASP: Continuous ASP-Based reasoning over RDF Streams;internet Routing and Non-monotonic reasoning;assessing Arguments with Schemes and Fallacies;simple Contrapositive Assumption-Based Frameworks;Argumentation-Based Explanations for Answer Sets Using ADF;treewidth and Counting Projected Answer Sets.
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;9783642405648
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.
Connections of intuitionistic and intermediate logics withlogicprogramming have been extensively studied in the literature. Among the different results in the literature we find equilibrium logic (Pearce, 1996) and ...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
Connections of intuitionistic and intermediate logics withlogicprogramming have been extensively studied in the literature. Among the different results in the literature we find equilibrium logic (Pearce, 1996) and Safe beliefs (Osorio et al., 2005). Pearce's approach admits a characterisation in terms of a fixpoint (consequence) operator on the here-and-there intermediate logic (Heyting, 1930), which is similar to the notion of theory completion in default and autoepistemic logics. Osorio's safe beliefs are also given in terms of a fixpoint operator under intuitionistic logic semantics. In this latter case, intuitionistic logic can be replaced by any intermediate logic without altering the result. In this paper we consider temporal equilibrium logic, an combination of equilibrium logic and linear-time temporal logic. In this context we extend Pearce's and Osorio's approach to temporal case and we discuss the relation of intuitionistic temporal logic and temporal logicprogramming.
We develop a computational approach to Metric Answer Set programming (ASP) to allow for expressing quantitative temporal constrains, like durations and deadlines. A central challenge is to maintain scalability when de...
ISBN:
(纸本)9783031742088;9783031742095
We develop a computational approach to Metric Answer Set programming (ASP) to allow for expressing quantitative temporal constrains, like durations and deadlines. A central challenge is to maintain scalability when dealing with fine-grained timing constraints, which can significantly exacerbate ASP's grounding bottleneck. To address this issue, we leverage extensions of ASP with difference constraints, a simplified form of linear constraints, to handle time-related aspects externally. Our approach effectively decouples metric ASP from the granularity of time, resulting in a solution that is unaffected by time precision.
Explainability in Artificial Intelligence (XAI) is crucial for enhancing the transparency and trustworthiness of AI systems. Our work focuses on providing clear explanations for why certain atoms in a given answer set...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
Explainability in Artificial Intelligence (XAI) is crucial for enhancing the transparency and trustworthiness of AI systems. Our work focuses on providing clear explanations for why certain atoms in a given answer set are evaluated as such, hence contributing to the understanding of the decisions made by Answer Set programming (ASP) systems. We employ simple inference rules to elucidate these decisions, avoiding complex derivations to maintain clarity. Moreover, we introduce the notion of preferred unit-provable unsatisfiable subsets (preferred 1-PUS) to identify relevant portions of ASP encodings, prioritizing program rules over assignments, withthe objective of minimizing the assumptions involved in the explanation process. the proposed principles are implemented in a new XAI system.
Assumption-based argumentation is one of the most prominent formalisms for logical (or structured) argumentation. It has been shown useful for representing defeasible reasoning and has tight links to logicprogramming...
详细信息
ISBN:
(纸本)9783030205287;9783030205270
Assumption-based argumentation is one of the most prominent formalisms for logical (or structured) argumentation. It has been shown useful for representing defeasible reasoning and has tight links to logicprogramming In this paper we study the Dung semantics for extended forms of assumption-based argumentation frameworks (ABFs), based on any contrapositive propositional logic, and whose defeasible rules are expressed by arbitrary formulas in that logic. In particular, new results on the well-founded semantics for such ABFs are reported, the redundancy of the closure condition is shown, and the use of disjunctive attacks is investigated. Finally, some useful properties of the generalized frameworks are considered.
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.
this paper presents so-called asl-explanation graphs for answer set programming based on a translation of extended logic programs to abstract dialectical frameworks (ADF). the graphs show how a literal can be derived ...
详细信息
ISBN:
(纸本)9783030205287;9783030205270
this paper presents so-called asl-explanation graphs for answer set programming based on a translation of extended logic programs to abstract dialectical frameworks (ADF). the graphs show how a literal can be derived from the program, and they evaluate in an argumentative way why necessary assumptions about literals not contained in an answer set hold. Withthe set of all asl-explanation graphs for a literal and an answer set, it is possible to explain and justify thoroughly why the literal is or is not contained in that answer set. Additionally, we provide a criterion to improve the clarity of explanations by pruning nodes without loss of information and selecting most significant asl-explanation graphs.
Although parity constraints are at the heart of many relevant reasoning modes like sampling or model counting, little attention has so far been paid to their integration into ASP systems. We address this shortcoming a...
详细信息
ISBN:
(纸本)9783030205287;9783030205270
Although parity constraints are at the heart of many relevant reasoning modes like sampling or model counting, little attention has so far been paid to their integration into ASP systems. We address this shortcoming and investigate a variety of alternative approaches to implementing parity constraints, ranging from rather basic ASP encodings to more sophisticated theory propagators (featuring Gauss-Jordan elimination). All of them are implemented in the xorro system by building on the theory reasoning capabilities of the ASP system dingo. Our comparative empirical study investigates the impact of the number and size of parity constraints on performance and indicates the merits of the respective implementation techniques. Finally, we benefit from parity constraints to equip xorro with means to sample answer sets, paving the way for new applications of ASP.
the ability to perform complex reasoning over data streams has recently become an important area of research in the Semantic Web community. Most of SPARQL-inspired engines have limitations in capturing sophisticated u...
详细信息
ISBN:
(纸本)9783030205287;9783030205270
the ability to perform complex reasoning over data streams has recently become an important area of research in the Semantic Web community. Most of SPARQL-inspired engines have limitations in capturing sophisticated user requirements and dealing with complex reasoning tasks. To address these challenges, we propose and implement C-ASP, a reasoning system based on the Answer Set programming (ASP) system Clingo and extended to handle continuous reasoning requests over RDF streams. We provide the syntax of the C-ASP language, as well as a set of examples in order to illustrate its expressive power. In addition, we present preliminary experimental results showing C-ASP performances.
暂无评论