The annual internationalworkshop LENLS (logic and Engineering of Natural Language Semantics) covers topics in formal linguistics and related fields, such as theoretical computer science, mathematical logic and formal...
详细信息
In this paper, we propose a novel approach that combines logicprogramming with ontological reasoning. The proposed approach enables the use of ontological terms directly within logic programs. We demonstrate the usef...
详细信息
In this paper, we propose a novel approach that combines logicprogramming with ontological reasoning. The proposed approach enables the use of ontological terms directly within logic programs. We demonstrate the usefulness of the proposed approach using a case-study of sensor-task matchmaking. This research was sponsored by the U.S. Army Research Laboratory and the U.K. Ministry of Defence and was accomplished under Agreement Number W911NF-06-3-0001. The views and conclusions contained in this document are those of the author(s) and should not be interpreted as representing the official policies, either expressed or implied, of the U.S. Army Research Laboratory, the U.S. Government, the U.K. Ministry of Defence or the U.K. Government. The U.S. and U.K. Governments are authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation hereon.
We describe a working multi-agent architecture based on Defeasible logicprogramming (DeLP) where agents are engaged in an argumentation to reach a common conclusion. Due to the distributed approach personalities and ...
详细信息
ISBN:
(纸本)9783642128042
We describe a working multi-agent architecture based on Defeasible logicprogramming (DeLP) where agents are engaged in an argumentation to reach a common conclusion. Due to the distributed approach personalities and opinions of the individual agents give rise to arguments and counterarguments concerning a particular query. This distribution of information leads to more intuitive modeling of argumentation from the point of view of knowledgerepresentation. We establish a sound theoretical framework of a specific type of argumentation in multi-agent systems and describe the computational issues involved in it. A formal comparison of the framework to DeLP is given and it is shown that the modeling specific scenarios of argumentation in the distributed setting bears a more rational representation. The framework described in this paper has been fully implemented and a short description of its features is given.
The proceedings contain 11 papers. The topics discussed include: publishing linked sensor data;semantics-based plug-and-play configuration of sensor network services;using SCXML for semantic sensor networks;linking se...
The proceedings contain 11 papers. The topics discussed include: publishing linked sensor data;semantics-based plug-and-play configuration of sensor network services;using SCXML for semantic sensor networks;linking sensor data - why, to what, and how?;the stimulus-sensor-observation ontology design pattern and its integration into the semantic sensor network ontology;bridging the gap between semantic web and networked sensors;short paper: semantic sensor composition;position paper: ontological logicprogramming;developing registries for the semantic sensor web using strdF and stSPARQL;challenges in linked stream data processing;and a contextualized cognitive perspective for linked sensor data.
The Directed Acyclic Graph (DAG), which can be generated by object oriented modelling languages, is often the most natural way of representing and manipulating a dynamic optimization problem. With this representation,...
详细信息
The Directed Acyclic Graph (DAG), which can be generated by object oriented modelling languages, is often the most natural way of representing and manipulating a dynamic optimization problem. With this representation, it is possible to step-by-step reformulate an (infinite dimensional) dynamic optimization problem into a (finite dimensional) non-linear program (NLP) by parametrizing the state and control trajectories. We introduce CasADi, a minimalistic computer algebra system written in completely self-contained C++. The aim of the tool is to offer the benifits of a computer algebra to developers of C++ code, without the overhead usually associated with such systems. In particular, we use the tool to implement automatic differentiation, AD. For maximum efficiency, CasADi works with two different graph representations interchangeably: One supporting only scalar-valued, built-in unary and binary operations and no branching, similar to the representation used by today's tools for automatic differentiation by operator overloading. Secondly, a representation supporting matrixvalued operations, branchings such as if-statements as well as function calls to arbitrary functions (e.g. ODE/DAE integrators). We show that the tool performs favorably compared to CppAD and ADOL-C, two state-of-the-art tools for AD by operator overloading. We also show how the tool can be used to solve a simple optimal control problem, minimal fuel rocket flight, by implementing a simple ODE integrator with sensitivity capabilities and solving the problem with the NLP solver IPOPT. In the last example, we show how we can use the tool to couple the modelling tool JModelica with the optimal control software ACADO Toolkit.
Open Answer Set programming (OASP) is a knowledgerepresentation paradigm that allows for a tight integration of logicprogramming rules and Description logic ontologies. Although several decidable fragments of OASP e...
详细信息
Ontologies are pervading many areas of knowledgerepresentation and management. To date, most research efforts have been spent on the development of sufficiently expressive languages for the representation and queryin...
详细信息
Ontologies are pervading many areas of knowledgerepresentation and management. To date, most research efforts have been spent on the development of sufficiently expressive languages for the representation and querying of ontologies;however, querying efficiency has received attention only recently, especially for ontologies referring to large amounts of data. In fact, it is still uncertain how reasoning tasks will scale when applied on massive amounts of data. This work is a first step toward this setting: it first shows that Resource Description Framework(Schema) [rdF(S)] ontologies can be expressed, without loss of semantics, into Answer Set programming (ASP). Then, based on a previous result showing that the SPARQL query language (a candidate W3C recommendation for rdF(S) ontologies) can be mapped to a rule-based language, it shows that efficient querying of big ontologies can be accomplished with a database oriented extension of the well known ASP system DLV, which we recently developed. Results reported in the article show that our proposed framework is promising for the improvement of both scalability and expressiveness of available rdF(S) storage and query systems.
The proceedings contain 7 papers. The topics discussed include: upgrading databases to ontologies;a sound and complete algorithm for simple conceptual logic programs;combining logicprogramming with description logics...
The proceedings contain 7 papers. The topics discussed include: upgrading databases to ontologies;a sound and complete algorithm for simple conceptual logic programs;combining logicprogramming with description logics and machine learning for the semantic web;a semantic stateless service description language;large scale reasoning on the semantic web;and reasoning on the web with open and closed predicates.
The proceedings contain 34 papers. The topics discussed include: mechanisms for importing modules;a solution for the man-man problem in the family history knowledge base;towards integrity constraints in OWL;processing...
The proceedings contain 34 papers. The topics discussed include: mechanisms for importing modules;a solution for the man-man problem in the family history knowledge base;towards integrity constraints in OWL;processing OWL2 ontologies using thea: an application of logicprogramming;reasoning in metamodeling enabled ontologies;CSage: use of a configurable semantically attributed graph editor as framework for editing and visualization;a conformance test suite for the OWL 2 RL/rdF rules language and the OWL 2 rdF-based semantics;improving the data quality of relational databases using OBDA and OWL 2 QL;using ontologies for medical image retrieval - an experiment;task representation and retrieval in an ontology-guided modeling system;and a platform for reasoning with OWL-EL knowledge bases in a peer-to-peer environment.
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...
详细信息
ISBN:
(纸本)9780769531779
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.
暂无评论