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.
this article presents cmMUS-a tool for deciding whether a clause belongs to some minimal unsatisfiable subset (MUS) of a given formula. While MUS-membership has a number of practical applications, related with underst...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
this article presents cmMUS-a tool for deciding whether a clause belongs to some minimal unsatisfiable subset (MUS) of a given formula. While MUS-membership has a number of practical applications, related with understanding the causes of unsatisfiability, it is computationally challenging-it is Sigma(P)(2)-complete. the presented tool cmMUS solves the problem by translating it to propositional circumscription, a well-known problem from the area of nonmonotonicreasoning. the tool constantly outperforms other approaches to the problem, which is demonstrated on a variety of benchmarks.
Over the years, nonmonotonic rules have proven to be a very expressive and useful knowledge representation paradigm. they have recently been used to complement the expressive power of Description logics (DLs), leading...
详细信息
Over the years, nonmonotonic rules have proven to be a very expressive and useful knowledge representation paradigm. they have recently been used to complement the expressive power of Description logics (DLs), leading to the study of integrative formal frameworks, generally referred to as hybrid knowledge bases, where both DL axioms and rules can be used to represent knowledge. the need to use these hybrid knowledge bases in dynamic domains has called for the development of update operators, which, given the substantially different way DLs and rules are usually updated, has turned out to be an extremely difficult task. In Slota and Leite (2010b Towards Closed World reasoning in Dynamic Open Worlds. theory and Practice of logicprogramming, 26th Int'l. conference on logicprogramming (ICLP'10) Special Issue 10(4-6) (July), 547-564.), a first step towards addressing this problem was taken, and an update operator for hybrid knowledge bases was proposed. Despite its significance-not only for being the first update operator for hybrid knowledge bases in the literature, but also because it has some applications-this operator was defined for a restricted class of problems where only the ABox was allowed to change, which considerably diminished its applicability. Many applications that use hybrid knowledge bases in dynamic scenarios require both DL axioms and rules to be updated. In this paper, motivated by real world applications, we introduce an update operator for a large class of hybrid knowledge bases where boththe DL component as well as the rule component are allowed to dynamically change. We introduce splitting sequences and splitting theorem for hybrid knowledge bases, use them to define a modular update semantics, investigate its basic properties, and illustrate its use on a realistic example about cargo imports.
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.
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.
Many multi-agent system applications involve software agents that reason about the behavior of other agents with which they interact in cooperation or competition. In order to design and develop those systems, the emp...
详细信息
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.
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 artificial intelligence (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.
the operation of a typical answer set solver begins with grounding-replacing the given program with a program without variables that has the same answer sets. When the given program contains function symbols, the proc...
详细信息
ISBN:
(纸本)9783642208942;9783642208959
the operation of a typical answer set solver begins with grounding-replacing the given program with a program without variables that has the same answer sets. When the given program contains function symbols, the process of grounding may not terminate. In this note we give an example of a pair of consistent, strongly equivalent programs such that one of them can be grounded by LPARSE, DLV, and GRINGO, and the other cannot.
暂无评论