We describe the major new features emerging from a significant redesign of the grounder gringo, building upon a grounding algorithm based on semi-naive database evaluation. Unlike previous versions, rules only need to...
详细信息
ISBN:
(纸本)9783642208942
We describe the major new features emerging from a significant redesign of the grounder gringo, building upon a grounding algorithm based on semi-naive database evaluation. Unlike previous versions, rules only need to be safe rather than domain-restricted.
Equilibrium logic provides a logical foundation for the stable model semantics of logic programs. Recently, parametrized logicprogramming was introduced withthe aim of presenting the syntax and natural semantics for...
详细信息
ISBN:
(纸本)9783642208942
Equilibrium logic provides a logical foundation for the stable model semantics of logic programs. Recently, parametrized logicprogramming was introduced withthe aim of presenting the syntax and natural semantics for parametrized logic programs, which are very expressive logic programs, in the sense that complex formulas are allowed to appear in the body and head of rules. Stable model semantics was defined for such parametrized logic programs. the aim of this paper is to introduce a parametrized version of equilibrium logicthat extends parametrized logic programs to general theories, and to show how these can be used to characterize and to study strong equivalence of temporal logic programs.
In this paper, we investigate the problem of contraction in Defeasible logicprogramming (DeLP), a logic-based approach for defeasible argumentation. We develop different notions of contraction based on both, the diff...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
In this paper, we investigate the problem of contraction in Defeasible logicprogramming (DeLP), a logic-based approach for defeasible argumentation. We develop different notions of contraction based on both, the different forms of entailment implicitly existent in argumentation-based formalisms and the influence literals exhibit in the reasoning process. We give translations of widely accepted rationality postulates for belief contraction to our framework. Moreover we discuss on the applicability of contraction for defeasible argumentation and the role of influence in this matter.
Over the last 25 years there has been considerable body of research into combinations of predicate logic and probability forming what has become known as (perhaps misleadingly) statistical relational artificial intell...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
Over the last 25 years there has been considerable body of research into combinations of predicate logic and probability forming what has become known as (perhaps misleadingly) statistical relational artificialintelligence (StaR-AI). I overview the foundations of the area, give some research problems, proposed solutions, outstanding issues, and clear up some misconceptions that have arisen. I discuss representations, semantics, inference and learning, and provide some references to the literature. this is intended to be an overview of foundations, not a survey of research results.
this paper is intended to construct a decidable first-order logic for appropriately expressing medical reasoning which may require to express not only time-dependency, paraconsistency, constructiveness, resource-sensi...
详细信息
ISBN:
(纸本)9783642238628
this paper is intended to construct a decidable first-order logic for appropriately expressing medical reasoning which may require to express not only time-dependency, paraconsistency, constructiveness, resource-sensitivity, but also order-sensitivity. A first-order temporal paraconsistent non-commutative logic is introduced as a Gentzen-type sequent calculus. this logic has no structural rules and has some bounded temporal operators and a paraconsistent negation connective. this logic is shown to be decidable and cut-eliminable.
We propose a portfolio-based solving approach to Answer Set programming (ASP). Our approach is homogeneous in considering several configurations of the ASP solver clasp. the selection among the configurations is reali...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
We propose a portfolio-based solving approach to Answer Set programming (ASP). Our approach is homogeneous in considering several configurations of the ASP solver clasp. the selection among the configurations is realized via Support Vector Regression. the resulting portfolio-based solver clasp-folio regularly outperforms clasp's default configuration as well as manual tuning.
this paper investigates a new approach for computing the inference of defeasible logic. the algorithm proposed can substantially reduced the theory size increase due to transformations while preserving the representat...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
this paper investigates a new approach for computing the inference of defeasible logic. the algorithm proposed can substantially reduced the theory size increase due to transformations while preserving the representation properties in different variants of DL. Experiments also show that our algorithm outperform traditional approach by several order of amplitudes.
logic programs with abstract constraint atoms provide a unifying framework for studying logic programs with various kinds of constraints. Establishing strong equivalence between logic programs is a key property for pr...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
logic programs with abstract constraint atoms provide a unifying framework for studying logic programs with various kinds of constraints. Establishing strong equivalence between logic programs is a key property for program maintenance and optimization, and for guaranteeing the same behavior for a revised original program in any context. In this paper, we study strong equivalence of logic programs with abstract constraint atoms. We first give a general characterization of strong equivalence based on a new definition of program reduct for logic programs with abstract constraints. then we consider a particular kind of program revision-constraint replacements addressing the question: under what conditions can a constraint in a program be replaced by other constraints, so that the resulting program is strongly equivalent to the original one.
We describe an approach for distributed access control policies that is based on a nonmonotonic semantics and the use of logicprogramming for policy specification and the evaluation of access requests. Our approach a...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
We describe an approach for distributed access control policies that is based on a nonmonotonic semantics and the use of logicprogramming for policy specification and the evaluation of access requests. Our approach allows assertions of relevance to access control to be made by individual agents or on a community-based level and different strengths of testimonial warrant may be distinguished by using various logical operators. We describe a form of ASP that allows for remote access request evaluation and we discuss a DLV-based implementation of our approach.
We present an initial exploration into the possibilities of applying current state-of-the-art answer set programming (ASP) tools-esp. conflict-driven answer set enumeration-for mining itemsets in 0-1 data. We evaluate...
详细信息
ISBN:
(纸本)9783642208942
We present an initial exploration into the possibilities of applying current state-of-the-art answer set programming (ASP) tools-esp. conflict-driven answer set enumeration-for mining itemsets in 0-1 data. We evaluate a simple ASP-based approach experimentally and compare it to a recently proposed framework exploiting constraint programming (CP) solvers for itemset mining.
暂无评论