When solving a job scheduling problem that involves humans, the times in which they are available must be taken into account. For practical acceptance of a scheduling tool, it is further crucial that the interaction&#...
详细信息
Anytime Multi-Agent Path Finding (MAPF) is a promising paradigm for finding fast and (near-)optimal solutions to large-scale multi-agent systems within a fixed time budget. the currently leading approach builds on Lar...
详细信息
.Abstract logicprogramming is about designing logicprogramming languages via the proof theoretic notion of uniform provability. It allows the design of purely logical, very expressive logicprogramming languages, en...
详细信息
ISBN:
(纸本)3540206426
.Abstract logicprogramming is about designing logicprogramming languages via the proof theoretic notion of uniform provability. It allows the design of purely logical, very expressive logicprogramming languages, endowed with a rich meta theory. this tutorial intends to expose the main ideas of this discipline in the most direct and simple way.
Component-based Software Development (CBD) represents a paradigm shift in software development. In the tutorial I will explain what CBD is about, briefly survey current component technology, and posit that logic Progr...
详细信息
ISBN:
(纸本)3540206426
Component-based Software Development (CBD) represents a paradigm shift in software development. In the tutorial I will explain what CBD is about, briefly survey current component technology, and posit that logicprogramming can play a role in next-generation CBD. In this abstract, I give an overview of the material that I plan to cover in the tutorial.
the standard selection rule in logicprogramming always selects the leftmost atom in each query. But for some applications this rule is not adequate, and dynamic scheduling, i.e. a mechanism to determine the selected ...
ISBN:
(纸本)3540206426
the standard selection rule in logicprogramming always selects the leftmost atom in each query. But for some applications this rule is not adequate, and dynamic scheduling, i.e. a mechanism to determine the selected atom at runtime, is needed. the complex (non-)termination behaviour related to dynamic scheduling has first been observed by Naish [3].
logic Information Systems (LIS) use logic in a uniform way to describe their contents, to query it, to navigate through it, to analyze it, and to update it. they can be given an abstract specification that does not de...
详细信息
ISBN:
(纸本)3540206426
logic Information Systems (LIS) use logic in a uniform way to describe their contents, to query it, to navigate through it, to analyze it, and to update it. they can be given an abstract specification that does not depend on the choice of a particular logic, and concrete instances can be obtained by instantiating this specification with a particular logic. In fact, a logic plays in a LIS the role of a schema in data-bases. We present the principles of LIS, and a system-level implementation. We compare withthe use of logic in logicprogramming, in particular through the notions of intention and extension.
In this paper we developed an Inductive logicprogramming (ILP) based framework ExOpaque that is able to extract a set of Horn clauses from an arbitrary opaque machine learning model, to describe the behavior of the o...
详细信息
ISBN:
(纸本)076953015X
In this paper we developed an Inductive logicprogramming (ILP) based framework ExOpaque that is able to extract a set of Horn clauses from an arbitrary opaque machine learning model, to describe the behavior of the opaque model with high fidelity while maintaining the simplicity of the Horn clauses for human interpretations.
We present results concerning the computational complexity of the key execution mechanisms required to handle Dependent And-Parallel executions in logicprogramming. We develop formal abstractions of the problems in t...
详细信息
ISBN:
(纸本)3540206426
We present results concerning the computational complexity of the key execution mechanisms required to handle Dependent And-Parallel executions in logicprogramming. We develop formal abstractions of the problems in terms of dynamic trees, design efficient data structures, and present some lower bound results. this work is part of a larger effort to understand, formalize, and study the complexity-theoretic and algorithmic issues in parallel implementations of logicprogramming.
We extend Clark's definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generalizing the Lin/Zhao theorem, shows that answer set...
详细信息
ISBN:
(纸本)3540206426
We extend Clark's definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generalizing the Lin/Zhao theorem, shows that answer sets for a disjunctive program can be characterized as the models of its completion that satisfy the loop formulas. the concept of a tight program and Fages' theorem are extended to disjunctive programs as well.
the handling of exceptions in multiclass problems is a tricky issue in inductive logicprogramming (ILP). In this paper we propose a new formalization of the ILP problem which accounts for default reasoning, and is en...
详细信息
the handling of exceptions in multiclass problems is a tricky issue in inductive logicprogramming (ILP). In this paper we propose a new formalization of the ILP problem which accounts for default reasoning, and is encoded with first-order possibilistic logic. We show that this formalization allows us to handle rules with exceptions, and to prevent an example to be classified in more than one class. the possibilistic logic view of ILP problem, can be easily handled at the algorithmic level as an optimization problem.
暂无评论