The proceedings contain 31 papers. The topics discussed include: automata for dynamic answer set solving: preliminary report;a speech about generative datalog and non-measurable sets;gradient-based supported model com...
The proceedings contain 31 papers. The topics discussed include: automata for dynamic answer set solving: preliminary report;a speech about generative datalog and non-measurable sets;gradient-based supported model computation in vector spaces;top-down splitting property for epistemic logic programs;fixpoint characterizations of disjunctive hybrid MKNF knowledge bases;modeling clique coloring via ASP(Q);modelling human mental-states in an action language following the theory of planned behavior;answer set programming with epistemic defaults;asynchronous forward-bounding algorithm with directional arc consistency;when is a program an actual cause?;and explainability through argumentation in logicprogramming.
The proceedings contain 27 papers. The topics discussed include: geometric reasoning on the traveling salesperson problem: comparing answer set programming and constraint logicprogramming approaches;routing and sched...
The proceedings contain 27 papers. The topics discussed include: geometric reasoning on the traveling salesperson problem: comparing answer set programming and constraint logicprogramming approaches;routing and scheduling in different ways: abridged preliminary report;explanation graphs for stable models of labelled logic programs;introducing ASP recipes and ASP chef;explanation graphs for stable models of labelled logic programs;preferential reasoning with typicality in ASP over weighted argumentation graphs in a gradual semantics;expanding the class of polynomial time computable well-founded semantics for hybrid MKNF;recursive aggregates as intensional functions;semantically guided scene generation via contextual reasoning and algebraic measures;value awareness and process automation: a reflection through school place allocation models;and argument analysis using answer set programming and semantics-guided large language models.
The proceedings contain 25 papers. The topics discussed include: conflict handling in product configuration using answer set programming;a normative model of explanation for binary classification legal ai and its impl...
The proceedings contain 25 papers. The topics discussed include: conflict handling in product configuration using answer set programming;a normative model of explanation for binary classification legal ai and its implementation on causal explanations of answer set programming;translating definitions into the language of logicprogramming: a case study;a semantics for probabilistic answer set programs with incomplete stochastic knowledge;constrained default logicprogramming;correct causal inference in probabilistic logicprogramming;a causal perspective on ai deception in games;epistemic logic programs: a novel perspective and some extensions;and modeling administrative discretion using goal-directed answer set programming.
Liftable probabilistic logic programs are a recently proposed restriction of probabilistic logic programs that impose a particular structure on the clauses such that inference can be performed in a lifted way. In this...
详细信息
Liftable probabilistic logic programs are a recently proposed restriction of probabilistic logic programs that impose a particular structure on the clauses such that inference can be performed in a lifted way. In this paper, we discuss a work in progress to perform link prediction in knowledge graphs by learning liftable probabilistic logic programs via regularization. 2022 Copyright for this paper by its authors.
In this work in progress, we give an example for a logic program with annotated disjunctions where the do-operator does not behave as intended. In particular, we see that the mutual exclusivity of heads in an annotate...
详细信息
In this work in progress, we give an example for a logic program with annotated disjunctions where the do-operator does not behave as intended. In particular, we see that the mutual exclusivity of heads in an annotated disjunction is not preserved after intervention. 2022 Copyright for this paper by its authors.
Extensions of Answer Set programming with language constructs from temporal logics, such as temporal equilibrium logic over finite traces (TELƒ), provide an expressive computational framework for modeling dynamic appl...
详细信息
Extensions of Answer Set programming with language constructs from temporal logics, such as temporal equilibrium logic over finite traces (TELƒ), provide an expressive computational framework for modeling dynamic applications. In this paper, we study the so-called past-present syntactic subclass, which consists of a set of logicprogramming rules whose body references to the past and head to the present. Such restriction ensures that the past remains independent of the future, which is the case in most dynamic domains. We extend the definitions of completion and loop formulas to the case of past-present formulas, which allows capturing the temporal stable models of a set of past-present temporal programs by means of an LTLƒexpression. 2023 Copyright for this paper by its authors.
This paper is an extended abstract of: J. Arias, M. Moreno-Rebato, J. A. Rodriguez-García, S. Ossowski, Modeling Administrative Discretion Using Goal-Directed Answer Set programming, in: Advances in Artificial In...
详细信息
Stochastic logicprogramming (Slp) and Distributional logicprogramming (Dlp) are two closely related probabilistic logicprogramming formalisms that have been previously studied in the context of machine learning. Th...
详细信息
This paper describes the continuing use of logical English as a logicprogramming language that can be interpreted by the s(CASP) reasoner. It builds upon the previous work, and proceeds to add the possibility of expr...
详细信息
This paper describes the continuing use of logical English as a logicprogramming language that can be interpreted by the s(CASP) reasoner. It builds upon the previous work, and proceeds to add the possibility of expressing global constraints in a form of English that can be easily understood by users, even without any specific technical training. In particular we will integrate constraints in a legal knowledge base, and demonstrate its use. We will then tackle the possibility of integrating the Event Calculus in LE, and querying the system with s(CASP). In conclusion, we will discuss the ongoing work in integrating LE and s(CASP), and assess the process, with it’s results and difficulties. 2023 Copyright for this paper by its authors.
The Traveling Salesperson Problem (TSP) is one of the best-known problems in computer science. Many instances and real world applications fall into the Euclidean TSP special case, in which each node is identified by i...
详细信息
The Traveling Salesperson Problem (TSP) is one of the best-known problems in computer science. Many instances and real world applications fall into the Euclidean TSP special case, in which each node is identified by its coordinates on the plane and the Euclidean distance is used as cost function. It is worth noting that in the Euclidean TSP more information is available than in the general case;in a previous publication, the use of geometric information has been exploited to speedup TSP solving for Constraint logicprogramming (CLP) solvers. In this work, we study the applicability of geometric reasoning to the Euclidean TSP in the context of an ASP computation. We compare experimentally a classical ASP approach to the TSP and the effect of the reasoning based on geometric properties. We also compare the speedup of the additional filtering based on geometric information on an Answer Set programming (ASP) solver and a CLP on Finite Domain (CLP(FD)) solver. 2023 Copyright for this paper by its authors.
暂无评论