Multi-SLD resolution is a variant of SLD resolution based on a simple idea: Let the allowed constraints be closed under disjunction, and provide a mechanism for collecting the solutions to a goal and turning these sol...
详细信息
In order to detect incorrect program behaviors, a number of approaches have been proposed, which include a combination of language-level constructs (procedure-level annotations such as assertions/contracts, gradual ty...
详细信息
In this paper, we propose a logical framework for reasoning about uncertain belief fusion. The framework is a combination of multi-agent epistemic logic and possibilistic logic. We use graded epistemic operators to re...
详细信息
Declarative process discovery algorithms aim to identify a subset of relationships between process’ activities ("constraints") that implicitly define the acceptable behavior of a process given a bag of its ...
详细信息
This paper is an overview of our results on the application of abstract interpretation concepts to various problems related to the verification of logic programs. These include the systematic design of semantics model...
详细信息
In the paper, we present some learning tasks that cannot be solved by two wellknown systems, FOIL and FOCL. Two kinds of explanations can be provided for these failures. For some tasks, the failures can be ascribed to...
详细信息
The logic programming language λProlog is based on the intuitionistic theory of higher-order hereditary Harrop formulas, a logic that significantly extends the theory of Horn clauses. A systematic exploitation ...
详细信息
An approximate Herbrand theorem is proved and used to establish Skolemization for first-order Lukasiewicz logic. Proof systems are then defined in the framework of hypersequents. In particular, extending a hypersequen...
详细信息
ISBN:
(纸本)9783540730989
An approximate Herbrand theorem is proved and used to establish Skolemization for first-order Lukasiewicz logic. Proof systems are then defined in the framework of hypersequents. In particular, extending a hypersequent calculus for propositional Lukasiewicz logic with usual Gentzen quantifier rules gives a calculus that is complete with respect to interpretations in safe MV-algebras, but lacks cut-elimination. Adding an infinitary rule to the cut-free version of this calculus gives a system that is complete for the full logic. Finally, a cut-free calculus with finitary rules is obtained for the one-variable fragment by relaxing the eigenvariable condition for quantifier rules.
In this paper, we present a goal-directed proof procedure for ASP with abduction. Our proposed procedure in this paper is correct for any consistent abductive framework proposed in [Kakas90a]. In other words, if the p...
详细信息
Abstract In prior work, we showed that logic programming compilation can be given a proof-theoretic justification for generic abstract logic programming languages, and demonstrated this technique in the case of heredi...
详细信息
暂无评论