We summarize the salient features of the current version of the answer set solver clasp, focusing oil the progress made since version RC4 of clasp. Apart from enhanced preprocessing and search-supporting techniques, a...
详细信息
ISBN:
(纸本)9783642042379
We summarize the salient features of the current version of the answer set solver clasp, focusing oil the progress made since version RC4 of clasp. Apart from enhanced preprocessing and search-supporting techniques, a particular emphasis lies on advanced reasoning modes, Such as cautious and brave reasoning, optimization, solution projection, and incremental solving.
Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is, among others, useful for ontology integration, where conflicting information arise...
详细信息
Defeasible reasoning is a rule-based approach for efficient reasoning with incomplete and inconsistent information. Such reasoning is, among others, useful for ontology integration, where conflicting information arises naturally;and for the modeling of business rules and policies, where rules with exceptions are often used. this paper describes these scenarios in more detail, and reports on the implementation of a system for defeasible reasoning on the Web. the system (a) is syntactically compatible with RuleML;(b) features strict and defeasible rules, priorities and two kinds of negation;(c) is based on a translation to logicprogramming with declarative semantics;(d) is flexible and adaptable to different intuitions within defeasible reasoning;and (e) can reason with rules, RDF, RDF Schema and (parts of) OWL ontologies.
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.
Withthe increasing speed and capacity of answer set solvers and showcase applications in a variety of fields, Answer Set programming (ASP) is maturing as a programming paradigm for declarative problem solving. Compre...
详细信息
Withthe increasing speed and capacity of answer set solvers and showcase applications in a variety of fields, Answer Set programming (ASP) is maturing as a programming paradigm for declarative problem solving. Comprehensive programming methodologies have been developed for procedural and object-oriented paradigms to assist programmers in developing their programs from the problem specification. In many cases, however it is not clear how, or even if, such methodologies can be applied to answer set programming. In this paper, we present a first and rather pragmatic methodology for ASP and illustrate our approach through the encoding of graphical puzzle.
Belief logicprogramming (BLP) is a novel form of quantitative logicprogramming in the presence of uncertain and inconsistent, information, which was designed to be able to combine and correlate evidence obtained fro...
详细信息
ISBN:
(纸本)9783642042379
Belief logicprogramming (BLP) is a novel form of quantitative logicprogramming in the presence of uncertain and inconsistent, information, which was designed to be able to combine and correlate evidence obtained from non-independent information sources. BLP has non-monotonic semantics based on the concepts of belief combination functions and is inspired by Dempster-Shafer theory of evidence. Most importantly, unlike the previous efforts to integrate uncertainty and logicprogramming, BLP can correlate structural information contained in rules and provides more accurate certainty estimates. the results are illustrated via simple, yet, realistic examples of rule-based Web service integration.
this paper describes an exercise in the formalization of commonsense with Answer Set programming aimed at finding the answer to an interesting riddle, whose solution is not obvious to many people. Solving the riddle r...
详细信息
ISBN:
(纸本)9783642042379
this paper describes an exercise in the formalization of commonsense with Answer Set programming aimed at finding the answer to an interesting riddle, whose solution is not obvious to many people. Solving the riddle requires a considerable amount of commonsense knowledge and sophisticated knowledge representation and reasoning techniques, including planning and adversarial reasoning. Most importantly, the riddle is difficult enough to make it unclear, at first analysis, whether and how Answer Set programming or other formalisms can be used to solve it.
the strength of answer set programming (ASP) lies in solving computationally challenging problems declaratively, and hopefully efficiently. A similar goal is shared by two other approaches. SAT and Constraint Programm...
详细信息
ISBN:
(纸本)9783642042379
the strength of answer set programming (ASP) lies in solving computationally challenging problems declaratively, and hopefully efficiently. A similar goal is shared by two other approaches. SAT and Constraint programming (CP). As future applications of ASP hinge on its Underlying solving techniques, in this note. I will briefly comment on the related techniques, and argue for the need of ASP systems to integrate with state-of-the-art techniques for constraint solving, and in general to serve as the core reasoning engine to glue other logstics and reasoning mechanisms together
We have recently started a Couple of spin-off companies which aim at exploiting ASP, and the DLV system in particular, in real-world applications. We briefly report on the first experiences, evidentiating the positive...
详细信息
ISBN:
(纸本)9783642042379
We have recently started a Couple of spin-off companies which aim at exploiting ASP, and the DLV system in particular, in real-world applications. We briefly report on the first experiences, evidentiating the positive aspects of ASP which allowed us to develop some successful applications, and some obstacles which should be overcome to improve ASP systems, and make them best suited for industry-level applications.
Probabilistic conditionals are a powerful means for expressing uncertain knowledge. In this paper, we describe a system implemented in Java performing probabilistic reasoning at optimum entropy. It provides nonmonoton...
详细信息
ISBN:
(纸本)9783642042379
Probabilistic conditionals are a powerful means for expressing uncertain knowledge. In this paper, we describe a system implemented in Java performing probabilistic reasoning at optimum entropy. It provides nonmonotonic belief change operations like revision and up-date and supports advanced querying facilities including diagnosis and what-if-analysis.
We present a framework which allows to combine answer-set programs in a way that consequences (rather than answer sets themselves) of programs can be used as input to other programs. Situations in which such a composi...
详细信息
We present a framework which allows to combine answer-set programs in a way that consequences (rather than answer sets themselves) of programs can be used as input to other programs. Situations in which such a composition of programs is required appear in many practical application problems. So far, to deal with such problems, multiple calls to answer-set solvers were usually indispensable, as a direct ASP encoding is often much less obvious. In addition, we provide a technique for compiling such frameworks into a single ASP program which consequently can be evaluated by a single call to an answer-set solver. Our approach relies on the recently introduced concept of manifold programs which make use of weak constraints to identify consequences of programs.
暂无评论