the proceedings contain 30 papers. the topics discussed include: applications of answer set programming where theory meets practice;when is it morally acceptable to break the rules? a preference-based approach;formal ...
the proceedings contain 30 papers. the topics discussed include: applications of answer set programming where theory meets practice;when is it morally acceptable to break the rules? a preference-based approach;formal reasoning methods for explainability in machine learning;from probabilistic logics to neuro-symbolic artificial intelligence;norms, policy and laws: modeling, compliance and violation;datalog-based systems can use incremental SMT solving;formal semantics and scalability for datalog with aggregates: a cardinality-based solution;a logicprogramming approach to regression based repair of incorrect initial belief states;and a hybrid neuro-symbolic approach for complex event processing.
the proceedings contain 15 papers. the topics discussed include: encoding choice logics in ASP;determining action reversibility in STRIPS using answer set programming;solving assembly line workload smoothing problem v...
the proceedings contain 15 papers. the topics discussed include: encoding choice logics in ASP;determining action reversibility in STRIPS using answer set programming;solving assembly line workload smoothing problem via answer set programming;a multi-shot ASP encoding for the aircraft routing and maintenance planning problem;action languages and COVID-19: lessons learned;causal analysis of events occurring in trajectories of dynamic domains;operationalizing declarative and procedural knowledge: a benchmark on logicprogramming Petri Nets (LPPNs);actual causality in contextual abduction;and dynamic epistemic logic with ASP updates: application to conditional planning.
Recently there has been an increasing interest in frameworks extending Dung's abstract Argumentation Framework (AF). Popular extensions include bipolar AFs and AFs with recursive attacks and necessary supports. Al...
详细信息
Recently there has been an increasing interest in frameworks extending Dung's abstract Argumentation Framework (AF). Popular extensions include bipolar AFs and AFs with recursive attacks and necessary supports. Although the relationships between AF semantics and Partial Stable Models (PSMs) of logic programs has been deeply investigated, this is not the case for more general frameworks extending AF. In this paper we explore the relationships between AF-based frameworks and PSMs. We show that every AF-based framework Delta can be translated into a logic programP(Delta)so that the extensions prescribed by different semantics of Delta coincide with subsets of the PSMs ofP(Delta). We provide a logicprogramming approach that characterizes, in an elegant and uniform way, the semantics of several AF-based frameworks. this result allows also to define the semantics for new AF-based frameworks, such as AFs with recursive attacks and recursive deductive supports.
In Probabilistic logicprogramming (PLP) the most commonly studied inference task is to compute the marginal probability of a query given a program. In this paper, we consider two other important tasks in the PLP sett...
详细信息
In Probabilistic logicprogramming (PLP) the most commonly studied inference task is to compute the marginal probability of a query given a program. In this paper, we consider two other important tasks in the PLP setting: the Maximum-A-Posteriori (MAP) inference task, which determines the most likely values for a subset of the random variables given evidence on other variables, and the Most Probable Explanation (MPE) task, the instance of MAP where the query variables are the complement of the evidence variables. We present a novel algorithm, included in the PITA reasoner, which tackles these tasks by representing each problem as a Binary Decision Diagram and applying a dynamic programming procedure on it. We compare our algorithm withthe version of ProbLog that admits annotated disjunctions and can perform MAP and MPE inference. Experiments on several synthetic datasets show that PITA outperforms ProbLog in many cases.
A distributed logicprogramming language with support for meta-programming and stream processing offers a variety of interesting research problems, such as: How can a versatile and stable data structure for the indexi...
详细信息
A distributed logicprogramming language with support for meta-programming and stream processing offers a variety of interesting research problems, such as: How can a versatile and stable data structure for the indexing of a large number of expressions be implemented with simple low-level data structures? Can low-level programming help to reduce the number of occur checks in Robinson's unification algorithm? this article gives the answers.
the multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at finding paths for multiple agents (e.g., robots) in an environment (e.g., an autonomous warehouse) such that no two agents col...
详细信息
the multi-agent path finding (MAPF) problem is a combinatorial search problem that aims at finding paths for multiple agents (e.g., robots) in an environment (e.g., an autonomous warehouse) such that no two agents collide with each other, and subject to some constraints on the lengths of paths. We consider a general version of MAPF, called mMAPF, that involves multi-modal transportation modes (e.g., due to velocity constraints) and consumption of different types of resources (e.g., batteries). the real-world applications of mMAPF require flexibility (e.g., solving variations of mMAPF) as well as explainability. Our earlier studies on mMAPF have focused on the former challenge of flexibility. In this study, we focus on the latter challenge of explainability, and introduce a method for generating explanations for queries regarding the feasibility and optimality of solutions, the nonexistence of solutions, and the observations about solutions. Our method is based on answer set programming.
this paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories. We extend the definition of program completion to programs with input and output in a ...
this paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories. We extend the definition of program completion to programs with input and output in a subset of the input language of the ASP grounder gringo, study the relationship between stable models and completion in this context, and describe preliminary experiments withthe use of two software tools, anthem and vampire, for verifying the correctness of programs with input and output. Proofs of theorems are based on a lemma that relates the semantics of programs studied in this paper to stable models of first-order formulas.
this paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories. We extend the definition of program completion to programs with input and output in a ...
详细信息
this paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories. We extend the definition of program completion to programs with input and output in a subset of the input language of the ASP grounder gringo, study the relationship between stable models and completion in this context, and describe preliminary experiments withthe use of two software tools, anthem and vampire, for verifying the correctness of programs with input and output. Proofs of theorems are based on a lemma that relates the semantics of programs studied in this paper to stable models of first-order formulas.
暂无评论