In this paper we consider an extension of logicprogramming that tackles the SemanticWeb challenge of acquiring rules combined with ontologies. To face this bottleneck problem we propose a framework that resorts to th...
详细信息
The authors of the paper have proposed a collaborative research project that should start in 2010 and proceed in three successive years. The goal of the proposed project is to develop tools and mechanisms for computer...
详细信息
ISBN:
(纸本)9788021050488
The authors of the paper have proposed a collaborative research project that should start in 2010 and proceed in three successive years. The goal of the proposed project is to develop tools and mechanisms for computer-aided natural-language analysis, knowledge management and reasoning. In a broader sense, the main objective is to propose a new solution to natural language analysis and reasoning based on the procedural semantics of Transparent Intensional logic (TIL). Primarily, our research is classified in the area of philosophical logic. Subsidiary works then fall under theoretical linguistics and computer science. Our research is focused on the temporal, modal and epistemic aspects of knowledgerepresentation and reasoning. The main problems under our scrutiny are: TIL proof calculus for hyperintensional, partial, typed lambda calculus;analysis of tenses and temporal logic;analysis of epistemic verbs and events;analysis of anaphora references and topic-focus articulation. Concerning practical applications, we develop functional programming language TIL-Script, the computational variant of TIL. The main result we aim to achieve is computer-aided analysis of natural-language texts based on web ontologies like WordNet, FrameNet/VerbNet, VerbaLex and large text corpora.
We introduce a new method for integrating relevant parts of knowledge extracted from biomedical ontologies and answering complex queries related to drug safety and discovery, using Semantic Web technologies and answer...
详细信息
The rule-based programming paradigm is omnipresent in a number of engineering domains. However, there are some fundamental semantical differences between it and classic programming approaches. No generic solution for ...
详细信息
ISBN:
(纸本)9783642006746
The rule-based programming paradigm is omnipresent in a number of engineering domains. However, there are some fundamental semantical differences between it and classic programming approaches. No generic solution for using rules to model business logic in classic software has been provided so far. In this paper a new approach for Generalized Rule-based programming (GREP) is given. It is based on the use of an advanced rule representation called XTT, which includes an extended attribute-based language, a non-monotonic inference strategy, with an explicit inference control at the rule level. The paper shows, how some typical programming constructs, as well as classic programs can be modelled with this approach. The paper also presents possibilities of an efficient integration of this technique with existing software systems. It describes the so-called Hybrid Operators in Prolog - a concept which extends the Generalized Rule Based programming Model (GREP). This extension allows a GREP-based application to communicate with the environment by providing input/output operations, user interaction, and process synchronization. Furthermore, it allows for integration of such an application with contemporary software technologies including Prolog-based code. The proposed Hybrid Operators extend GREP forming a knowledge-based software development concept.
Multi-agent systems are viewed as consisting of individual agents whose behaviors are regulated by an organization artefact. This paper presents a simplified version of a programming language that is designed to imple...
详细信息
ISBN:
(纸本)9783642053009
Multi-agent systems are viewed as consisting of individual agents whose behaviors are regulated by an organization artefact. This paper presents a simplified version of a programming language that is designed to implement norm-based artefacts. Such artefacts are specified in terms of norms being enforced by monitoring, regimenting and sanctioning mechanisms. The syntax and operational semantics of the programming language are introduced and discussed. A logic is presented that can be used to specify and verify properties of programs developed in this language.
In this article, we define a new variant of Cai-Furer-Immerman construction. With this construction and some conditions of Dawar and Richerby, we are able to show that inflationary fixed point logic with counting (IFP...
详细信息
ISBN:
(纸本)9783642022692
In this article, we define a new variant of Cai-Furer-Immerman construction. With this construction and some conditions of Dawar and Richerby, we are able to show that inflationary fixed point logic with counting (IFP+C) does not capture PTIME on the class of balanced graphs.
Traditional object-oriented programming languages can be difficult to use when working with ontologies, leading to the creation of domain-specific languages designed specifically for ontology processing. Prolog, with ...
详细信息
Traditional object-oriented programming languages can be difficult to use when working with ontologies, leading to the creation of domain-specific languages designed specifically for ontology processing. Prolog, with its logic-based, declarative semantics offers many advantages as a host programming language for querying and processing OWL2 ontologies. The SWI-Prolog semweb library provides some support for OWL but until now there has been a lack of any library providing direct and comprehensive support for OWL2. We have developed Thea, a library based directly on the OWL2 functionalstyle syntax, allowing storage and manipulation of axioms as a Prolog database. Thea can translate ontologies to Description logic programs but the emphasis is on using Prolog as an application programming and processing language rather than a reasoning engine. Thea offers the ability to seamless connect to the java OWL API and OWLLink servers. Thea also includes support for SWRL. In this paper we provide examples of using Thea for processing ontologies, and compare the results to alternative methods. Thea is available from GitHub: http://***/vangelisv/ thea.
A logic of Multiple-valued Argumentation (LMA) was formalized by Takahashi and Sawamura on an expressive knowledgerepresentation language, Extended Annotated logicprogramming (EALP). LMA allows agents to construct a...
详细信息
ISBN:
(纸本)9783642033377
A logic of Multiple-valued Argumentation (LMA) was formalized by Takahashi and Sawamura on an expressive knowledgerepresentation language, Extended Annotated logicprogramming (EALP). LMA allows agents to construct arguments under uncertain knowledge and to argue with other agents on uncertain issues in the open networked heterogeneous environment. In this paper, we demonstrate its expressiveness and applicability through implementing it in a networked environment and applying it to diverse uncertain domains in which decision-making is sought in an argumentative way. We then show that it is the diversity of truth values in LMA that allows for an extensive applicability of it.
In this paper we propose dynamic description logic for formalizing multi-agent cooperation process with a clearly defined syntax and semantics. By combining the features of knowledgerepresentation and reasoning of de...
详细信息
ISBN:
(纸本)9783642033377
In this paper we propose dynamic description logic for formalizing multi-agent cooperation process with a clearly defined syntax and semantics. By combining the features of knowledgerepresentation and reasoning of description logic and action theory for multi-agent interaction, our logic is effective and significant both for static and dynamic environment. On the static side, we employ description logic for the representation and reasoning of beliefs and goals. On the dynamic side, we adopt the object-oriented method to describe actions. The description of each action is composed of models, preconditions and effects. It can reflect the real changes of the world and is very suitable for belief revision and action planning. Based on our logic, we investigate how to form joint goal for multi-agent cooperation. In particular, we propose an effective dynamic planning algorithm for scheduling sub goals, which is greatly crucial for coordinating multi-agent behaviors.
Data-oriented workflows are often used in scientific applications for executing a set of dependent tasks across multiple computers. We discuss how these can be modeled using lambda calculus, and how ideas from functio...
详细信息
Data-oriented workflows are often used in scientific applications for executing a set of dependent tasks across multiple computers. We discuss how these can be modeled using lambda calculus, and how ideas from functional programming are applicable in the design of workflows. Such an approach avoids the restrictions often found in workflow languages, permitting the implementation of complex application in logic and data manipulation. This paper explains why lambda calculus is an appropriate model for workflow representation, and how a suitably efficient implementation can provide a wide range of capabilities to developers. The presented approach also permits high-level workflow features to be implemented at user level, in terms of a small set of low-level primitives provided by the language implementation. Copyright (C) 2009 John Wiley & Sons, Ltd.
暂无评论