the idea of answer set programming is to represent a given computational problem by a logic program whose answer sets correspond to solutions, and then use an answer set solver, such as SMODELS or DLV, to find an answ...
详细信息
the idea of answer set programming is to represent a given computational problem by a logic program whose answer sets correspond to solutions, and then use an answer set solver, such as SMODELS or DLV, to find an answer set for this program. Applications of this method to planning are related to the line of research on the frame problem that started withthe invention of formal nonmonotonicreasoning in 1980. (C) 2002 Elsevier Science B.V. All rights reserved.
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.
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
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 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.
the purpose of this paper is to provide a brief overview of how logicprogramming technology has been used by our team in addressing the problem of tertiary protein structure determination. the proposed approach tackl...
详细信息
ISBN:
(纸本)9783642042379
the purpose of this paper is to provide a brief overview of how logicprogramming technology has been used by our team in addressing the problem of tertiary protein structure determination. the proposed approach tackles the problem from the perspective of viewing protein structure as a folding of protein sequences in a discrete representation of space (a crystal lattice structure). logicprogramming and constraint programming technologies can be effectively used to provide an elegant and effective Solution.
We show that the concepts of strong and uniform equivalence of logic programs can be generalized to an abstract algebraic setting of operators on complete lattices. Our results imply characterizations of strong and un...
详细信息
暂无评论