the system ASPARTIX is a tool for computing acceptable extensions for a broad range of formalizations of Dung's argumentation framework and generalizations thereof. ASPARTIX relies on a fixed disjunctive datalog p...
详细信息
ISBN:
(纸本)9783540899815
the system ASPARTIX is a tool for computing acceptable extensions for a broad range of formalizations of Dung's argumentation framework and generalizations thereof. ASPARTIX relies on a fixed disjunctive datalog program which takes an instance of an argumentation framework as input. and uses the answer-set solver DIN for computing the type of extension specified by the user.
Nieuwenhuis, Oliveras, and Tinelli showed how to describe enhancements of the Davis-Putnam-Logemann-Loveland algorithm using transition systems, instead of pseudocode. We design a similar framework for three algorithm...
详细信息
ISBN:
(纸本)9783540899815
Nieuwenhuis, Oliveras, and Tinelli showed how to describe enhancements of the Davis-Putnam-Logemann-Loveland algorithm using transition systems, instead of pseudocode. We design a similar framework for three algorithms that generate answer sets for logic programs: smodels, asp-sat with Backtracking, and a newly designed and implemented algorithm sup. this approach to describing answer set solvers makes it easier to prove their correctness, to compare them, and to design new systems.
In this paper we consider an extension of logicprogrammingthat tackles the SemanticWeb challenge of acquiring rules combined with ontologies. To face this bottleneck problem we propose a framework that resorts to th...
详细信息
作者：
Lassen, Ole TorpRoskilde Univ Ctr
Dept Commun Business & Informat Technol Res Grp PLIS Programming Log & Intelligent Syst DK-4000 Roskilde Denmark
In this work, we consider probabilistic models that can infer biological information solely from biological sequences such as DNA. Traditionally, computational models for biological sequence analysis have been impleme...
详细信息
this paper presents a Knowledge Base prospect for FO(ID), in extension of classical logic with inductive definitions. this logic is a natural integration of classical logic and logicprogramming based on the view of a...
详细信息
ISBN:
(纸本)9783540899815
this paper presents a Knowledge Base prospect for FO(ID), in extension of classical logic with inductive definitions. this logic is a natural integration of classical logic and logicprogramming based on the view of a logic program as a definition. We discuss the relationship between inductive definitions and common sense reasoning and the strong similarities mid striking differences with ASP and Abductive LP. We report on inference systems that combine state-of-the-art techniques of SAT and ASP. Experiments show that FO(ID) model expansion systems are competitive withthe best ASP-solvers.
Open Answer Set programming (OASP) is a knowledge representation paradigm that allows for a tight integration of logicprogramming rules and Description logic ontologies. Although several decidable fragments of OASP e...
详细信息
the proceedings contain 9 papers. the topics discussed include: answer-set programming encodings for argumentation frameworks;efficient parallel ASP instantiation via dynamic rewriting;modeling preferences on resource...
the proceedings contain 9 papers. the topics discussed include: answer-set programming encodings for argumentation frameworks;efficient parallel ASP instantiation via dynamic rewriting;modeling preferences on resource consumption and production in ASP;towards logic programs with ordered and unordered disjunction;quantified logic programs, revisited;on demand indexing for the DLV instantiator;integrating grounding in the search process for answer set computing;FO(ID) as an extension of DL with rules;and classical logic event calculus as answer set programming.
Despite the recent. formalization of the Web in terms of Representational State Transfer (REST) architectural style and Resource-Oriented Architecture (ROA), current tools for Web programming generally misunderstand i...
详细信息
ISBN:
(纸本)9783540899815
Despite the recent. formalization of the Web in terms of Representational State Transfer (REST) architectural style and Resource-Oriented Architecture (ROA), current tools for Web programming generally misunderstand its design. Based on REST/ROA insights, we claim that logic languages are suited for promoting the Web architecture e and principles. the mapping of REST/ROA abstractions onto elements of Contextual logicprogramming also permits runtime modification of resource behavior. In this paper we present Web logicprogramming as a Prolog-based language for the Web embedding REST/ROA principles, meant to be the basis of all application framework for rapid prototyping.
We show how a fuzzy answer set program can be compiled to an equivalent fuzzy propositional theory whose models correspond to the answer sets of the program. this creates a basis for constructing fuzzy answer set solv...
详细信息
ISBN:
(纸本)9783540899815
We show how a fuzzy answer set program can be compiled to an equivalent fuzzy propositional theory whose models correspond to the answer sets of the program. this creates a basis for constructing fuzzy answer set solvers, such as solvers based on fuzzy SAT-solvers or on linear programming.
this is a review of some of the definitions of the concept of a stable model that have been proposed in the literature. these definitions are equivalent to each other, at, least, when applied to traditional Prolog-sty...
详细信息
ISBN:
(纸本)9783540899815
this is a review of some of the definitions of the concept of a stable model that have been proposed in the literature. these definitions are equivalent to each other, at, least, when applied to traditional Prolog-style programs, but there, are reasons why each of them is valuable and interesting. A new characterization of stable models can suggest an alternative picture of the intuitive meaning of logic programs;or it can lead to new algorithms for generating stable models;or it can work better than others Mien We turn to generalizations of the traditional syntax that, are important from the perspective of answer set programming;or it can be more convenient for use in proofs;or it can be interesting simply because it demonstrates a relationship between seemingly unrelated ideas.
暂无评论