the proceedings contain 31 papers. the special focus in this conference is on logicprogramming. the topics include: Solving the multiplication constraint in several approximation spaces;design of syntactic program tr...
ISBN:
(纸本)9783540429357
the proceedings contain 31 papers. the special focus in this conference is on logicprogramming. the topics include: Solving the multiplication constraint in several approximation spaces;design of syntactic program transformations by abstract interpretation of semantic transformations;building real-life applications with prolog;a close look at constraint-based concurrency;probabilistic databases and logicprogramming;understanding memory management in prolog systems;on a tabling engine that can exploit or-parallelism;revisiting the cardinality operator and introducing the cardinality-path constraint family;optimizing compilation of constraint handling rules;practical aspects for a working compile time garbage collection system for mercury;positive boolean functions as multiheaded clauses;speculative beats conservative justification;local and symbolic bisimulation using tabled constraint logicprogramming;a simple scheme for implementing tabled logicprogramming systems based on dynamic reordering of alternatives;ultimate well-founded and stable semantics for logic programs with aggregates;alternating fixed points in boolean equation systems as preferred stable models;semantics of normal logic programs with embedded implications;a multi-adjoint logic approach to abductive reasoning;an order-sorted resolution with implicitly negative sorts;logicprogramming in a fragment of intuitionistic temporal linear logic;a computational model for functional logic deductive databases and a logicprogramming approach to the integration, repairing and querying of inconsistent databases.
the proceedings contain 30 papers. the special focus in this conference is on logicprogramming and Non-monotonic Reasoning. the topics include: A Sequent Calculus for Generalized Inductive Definitions;tExplain: ...
ISBN:
(纸本)9783031742088
the proceedings contain 30 papers. the special focus in this conference is on logicprogramming and Non-monotonic Reasoning. the topics include: A Sequent Calculus for Generalized Inductive Definitions;tExplain: Information Extraction with Explanations;ASP-Based Large Neighborhood Prioritized Search for Course Timetabling;towards Industrial-Scale Product Configuration;An ILASP-Based Approach to Repair Petri Nets;abstract Dialectical Frameworks are Boolean Networks;Using Learning from Answer Sets for Robust Question Answering with LLM;Multi-paradigm logicprogramming in the ErgoAI System;An ASP-Based Approach to Water Distribution System Reconstruction;consequence Operators of Characterization logics – the Case of Abstract Argumentation;Efficiently Grounding FOL Using Bit Vectors;Integrating MiniZinc with ASP Chef: Browser-Based Constraint programming for Education and Prototyping;answer Set Explanations via Preferred Unit-Provable Unsatisfiable Subsets;Towards Mass Spectrum Analysis with ASP;monitoring and Scheduling of Semiconductor Failure Analysis Labs;a Semantical Approach to Abstraction in Answer Set programming and Assumption-Based Argumentation;on Forgetting in Assumption-Based Argumentation;Towards Explainable Weather Forecasting through FastLAS;semantic-Based Arguments Using logicprogramming Rewriting Systems;modelling Dialogues in a Concurrent Language for Argumentation;a Fixpoint Characterisation of Temporal Equilibrium logic;a Category-theoretic Perspective on Higher-Order Approximation Fixpoint theory;a Simulation for Supply Chains Contract Execution;Reasoning and Explanation Generation in Ad Hoc Collaboration Between Humans and Embodied AI;policies, Penalties, and Autonomous Agents;LTLf2ASP: LTLf Bounded Satisfiability in ASP;Integrating Structured Declarative Language (SDL) into ASP Chef;a Generalisation of Epistemic Splitting Property.
this special issue of theory and Practice of logicprogramming (TPLP) contains the regular papers accepted for presentation at the 34-thinternationalconference on logicprogramming (iclp 2018), held in Oxford, Unite...
详细信息
this special issue of theory and Practice of logicprogramming (TPLP) contains the regular papers accepted for presentation at the 34-thinternationalconference on logicprogramming (iclp 2018), held in Oxford, United Kingdom, from July 14th to July 17th, 2018.
In answer set programming, two groups of rules are considered strongly equivalent if they have the same meaning in any context. Strong equivalence of two programs can be sometimes established by deriving rules of each...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
In answer set programming, two groups of rules are considered strongly equivalent if they have the same meaning in any context. Strong equivalence of two programs can be sometimes established by deriving rules of each program from rules of the other in an appropriate deductive system. this paper shows how to extend this method of proving strong equivalence to programs containing the counting aggregate.
ErgoAI (abbr. Ergo) is a high level, multi-paradigm logicprogramming language and system developed by Coherent Knowledge Systems as an enhancement of and a successor to the popular Flora-2 system. Ergo is oriented to...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
ErgoAI (abbr. Ergo) is a high level, multi-paradigm logicprogramming language and system developed by Coherent Knowledge Systems as an enhancement of and a successor to the popular Flora-2 system. Ergo is oriented towards scalable knowledge representation and reasoning, and can exploit both structured knowledge as well as knowledge derived from external sources such as vector embeddings. From the start, Ergo (and Flora-2 before it) were designed to exploit the well-founded semantics for reasoning in a multi-paradigm environment, including object-based logic (F-logic) with non-monotonic inheritance;higher order syntax in the style of HiLog;defeasibility of rules;semantically clean transactional updates;and extensive use of subgoal delay for better logical behavior and performance. Although Ergo programs are compiled into XSB and adopt many Prolog features, Ergo is altogether a different language with functionality equivalent to major Prologs.
Answer-set programming (ASP) is a declarative logicprogramming paradigm that provides an efficient problem-solving approach in logic-based artificial intelligence (AI). While it has proven successful, ASP encounters ...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
Answer-set programming (ASP) is a declarative logicprogramming paradigm that provides an efficient problem-solving approach in logic-based artificial intelligence (AI). While it has proven successful, ASP encounters specific situations where its language falls short of accurately representing and reasoning about incomplete information. Researchers now widely agree that ASP requires powerful introspective reasoning withthe use of epistemic modal operators;yet, despite long-lasting debates on how to extend ASP with such operators, they cannot reach a consensus on satisfactory semantics. Cabalar et al. argue that such research should be grounded in formal robustness. thus, inspired by ASP's foundational properties, they introduce a structural principle called epistemic splitting and designate it as one of the compulsory criteria for epistemic ASP. this paper generalises their approach to a more comprehensive, meticulous, and conservative extension of ASP-splitting, thereby enhancing its applicability and efficiency.
Petri nets are a class of models of computation used to compactly represent discrete event systems. Among many application domains, they have now become the most prominent formalism to express process models in Proces...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
Petri nets are a class of models of computation used to compactly represent discrete event systems. Among many application domains, they have now become the most prominent formalism to express process models in Process Mining, thanks to their formal semantics that enables automated analysis techniques. In this context, model repair is the task of aligning a process model with actual executions of the process. Current solutions to model repair do not allow for embedding domain knowledge, providing guarantees of rigor, and enforcing structural requirements at the same time. In this paper, we fill this gap by proposing an approach based on the Inductive logicprogramming system ILASP. We then implement our approach and perform an experimental evaluation, showing both its expressiveness and feasibility.
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.
Traditionally, in the argumentation theory literature structured arguments are constructed from rules interpretations aiming to build well-supported deductive evidence. Different from other approaches, we emphasize th...
详细信息
ISBN:
(纸本)9783031742088;9783031742095
Traditionally, in the argumentation theory literature structured arguments are constructed from rules interpretations aiming to build well-supported deductive evidence. Different from other approaches, we emphasize the role of investigating general frameworks that can also provide a consistent and well-defined justification for a conclusion that cannot be inferred and there is certainty about it, which we call here NAF-arguments, which have been less explored in the formal argumentation theory, despite its potential use in practical applications for building nuanced well-structured explanations and justifications. this article introduces the so-called semantic argumentation guaranteeing well-known principles for quality in structured argumentation, and withthe ability to generate two types of arguments, those where the conclusion atoms are semantically interpreted as true, and those where the conclusion is assumed to be false, we call them here semantic and NAF-arguments respectively. this framework is defined on the set of all logic programs in terms of rewriting systems based on a confluent set of transformation rules, the so-called Confluent logicprogramming Systems, making this approach a general framework. Additionally, we introduce a method for building such arguments using the program's strata through partial interpretations. We implement our framework named semantic argumentation solver available open source.
暂无评论