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 52 papers. the topics discussed include: complexity and scalability of reasoning in many-valued weighted knowledge bases with typicality;benchmarking for integrating logic rules with everything...
the proceedings contain 52 papers. the topics discussed include: complexity and scalability of reasoning in many-valued weighted knowledge bases with typicality;benchmarking for integrating logic rules with everything else;explanations for answer set programming;a dataflow analysis for comparing and reordering predicate arguments;towards a rule-based approach for deriving abstract domains;‘would life be more interesting if I were in AI?’ answering counterfactuals based on probabilistic inductive logicprogramming;multiple query satisfiability of constrained horn clauses;towards one-shot learning for text classification using inductive logicprogramming;on the potential of CLIP for compositional logical reasoning;and bottom-up stratified probabilistic logicprogramming with Fusemate.
An abstract is not available for this content. As you have access to this content, full HTML content is provided on this page. A PDF of this content is also available in through the ‘Save PDF’ action button.
An abstract is not available for this content. As you have access to this content, full HTML content is provided on this page. A PDF of this content is also available in through the ‘Save PDF’ action button.
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.
Argumentation is used to make important decisions based on the information available. We tackle the question of whether it is possible to automatically extract argumentation from a given set of documents to justify a ...
详细信息
Argumentation is used to make important decisions based on the information available. We tackle the question of whether it is possible to automatically extract argumentation from a given set of documents to justify a given claim. We propose a framework that (i) extracts an argumentation structure from a given set of documents using Large Language Models (LLMs), (ii) represents it as an answer set program, (iii) and then uses the answer set program to prove the claim. We use a semantics-guided approach that leverages the FrameNet lexical database to generate sub-claims that are anchored to the concepts related to the claim. We demonstrate the efficacy of our method with an example. 2023 Copyright for this paper by its authors.
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.
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...
详细信息
We are interested in automatizing reasoning with and about study regulations, catering to various stakeholders, ranging from administrators, over faculty, to students at different stages. Our work builds on an extensi...
详细信息
We are interested in automatizing reasoning with and about study regulations, catering to various stakeholders, ranging from administrators, over faculty, to students at different stages. Our work builds on an extensive analysis of various study programs at the University of Potsdam. the conceptualization of the underlying principles provides us with a formal account of study regulations. In particular, the formalization reveals the properties of admissible study plans. Withthese at end, we propose an encoding of study regulations in Answer Set programmingthat produces corresponding study plans. Finally, we show how this approach can be extended to a generic user interface for exploring study plans. 2023 Copyright for this paper by its authors.
暂无评论