Answer Set programming (ASP) is a powerful language for knowledge representation and reasoning, that has been developed in the field of nonmonotonicreasoning and logicprogramming. the high knowledge-modeling power o...
详细信息
this paper presents a novel approach for exploiting an ontology in an ontology-based information extraction system, which substitutes part of the extraction process withreasoning, guided by a set of automatically acq...
详细信息
this paper presents a novel approach for exploiting an ontology in an ontology-based information extraction system, which substitutes part of the extraction process withreasoning, guided by a set of automatically acquired rules.
Answer set programming (ASP) is nowadays one of the most popular modeling languages in the areas of Knowledge Representation and Artificial Intelligence. Hereby one represents the problem at hand in such a way that ea...
详细信息
ISBN:
(纸本)9783642405648
Answer set programming (ASP) is nowadays one of the most popular modeling languages in the areas of Knowledge Representation and Artificial Intelligence. Hereby one represents the problem at hand in such a way that each model of the ASP program corresponds to one solution of the original problem. In recent years, several tools which support the user in developing ASP applications have been introduced. However, explicit treatment of one of the main aspects of ASP, multiple solutions, has received less attention within these tools. In this work, we present a novel system to visualize relations between answer sets of a given program. the core idea of the system is that the user specifies the concept of a relation by an ASP program itself. this yields a highly flexible system that suggests potential applications beyond development environments, e.g., applications in the field of abduction, which we will discuss in a case study.
Minimalist Grammars (MG) are viewed as a resource consuming system where syntactic operations are triggered when a positive form of a feature matches with its negative form. But a problem arises when a feature lacks a...
详细信息
Minimalist Grammars (MG) are viewed as a resource consuming system where syntactic operations are triggered when a positive form of a feature matches with its negative form. But a problem arises when a feature lacks a positive/negative value. For the latter case, we introduce a default inference rule in order to account for the underspecification of the feature in a lexical entry.
In this paper, we describe our ongoing work on the application of the Aspect-Oriented programming paradigm to the problem of ontology modularization driven by overlapping modularization requirements. We examine common...
详细信息
In this paper, we describe our ongoing work on the application of the Aspect-Oriented programming paradigm to the problem of ontology modularization driven by overlapping modularization requirements. We examine commonalities between ontology modules and software aspects and propose an approach to applying the latter to the problem of a priori construction of modular ontologies and a posteriori ontology modularization.
Signaling pathways are seen as high criticalities in our understanding of mechanisms of biological functions. In this paper, we propose default logic for diagnostic of Discrete Time System (DTS) by focusing on automat...
详细信息
ISBN:
(纸本)9780769550930
Signaling pathways are seen as high criticalities in our understanding of mechanisms of biological functions. In this paper, we propose default logic for diagnostic of Discrete Time System (DTS) by focusing on automatic synthesis of the signaling pathways from factors within the cell. An essential component of this approach is using default logic to acquire facts about biological knowledge of intracellular communication. By choosing an adequate representation of biological knowledge, the "reasoning" is able to assign in acquisition of the facts and extract interactions necessary for the synthesis of the signaling pathways.
Answer Set programming is a well-established paradigm of declarative programming in close relationship with other declarative formalisms such as SAT Modulo theories, Constraint Handling Rules, PDDL and many others. Si...
详细信息
ISBN:
(纸本)9783642405648
Answer Set programming is a well-established paradigm of declarative programming in close relationship with other declarative formalisms such as SAT Modulo theories, Constraint Handling Rules, PDDL and many others. Since its first informal editions, ASP systems are compared in the nowadays customary ASP Competition. the fourth ASP Competition, held in 2012/2013, is the sequel to previous editions and it was jointly organized by University of Calabria (Italy) and the Vienna University of Technology (Austria). Participants competed on a selected collection of benchmark problems, taken from a variety of research areas and real world applications. the Competition featured two tracks: the Model& Solve Track, held on an open problem encoding, on an open language basis, and open to any kind of system based on a declarative specification paradigm;and the System Track, held on the basis of fixed, public problem encodings, written in a standard ASP language.
Metabolic network reconstruction is of great biological relevance because it offers a way to investigate the metabolic behavior of organisms. However, reconstruction remains a difficult task at boththe biological and...
详细信息
ISBN:
(纸本)9783642405648
Metabolic network reconstruction is of great biological relevance because it offers a way to investigate the metabolic behavior of organisms. However, reconstruction remains a difficult task at boththe biological and computational level. Building on previous work establishing an ASP-based approach to this problem, we present a report from the field resulting in the discovery of new biological knowledge. In fact, for the first time ever, we automatically reconstructed a metabolic network for a macroalgae. We accomplished this by taking advantage of ASP's combined optimization and enumeration capacities. Both computational tasks build on an improved ASP problem representation, incorporating the concept of reversible reactions. Interestingly, optimization greatly benefits from the usage of unsatisfiable cores available in the ASP solver unclasp. Applied to Ectocarpus siliculosus, only the combination of unclasp and clasp allowed us to obtain a metabolic network able to produce all recoverable metabolites among the experimentally measured ones. Moreover, 70% of the identified reactions are supported by an homologous enzyme in Ectocarpus siliculosus, confirming the quality of the reconstructed network from a biological viewpoint.
Although several proposals to combine description logics withlogicprogramming rules have been brought forward, hardly any of these approaches capture the dynamic nature of the Semantic Web. In this paper, we look at...
详细信息
Discourse relation recognition is the task of identifying the semantic relationships between textual units. Conventional approaches to discourse relation recognition exploit surface information and syntactic informati...
详细信息
Discourse relation recognition is the task of identifying the semantic relationships between textual units. Conventional approaches to discourse relation recognition exploit surface information and syntactic information as machine learning features. However, the performance of these models is severely limited for implicit discourse relation recognition. In this paper, we propose an abductive theorem proving (ATP) approach for implicit discourse relation recognition. the contribution of this paper is that we give a detailed discussion of an ATP-based discourse relation recognition model with open-domain web texts.
暂无评论