Summary form only given. The panel moderated by Bernhard Steffen (University of Dortmund) reviews this development, discusses the perspectives, and establishes recommendations for future directions of software enginee...
详细信息
Summary form only given. The panel moderated by Bernhard Steffen (University of Dortmund) reviews this development, discusses the perspectives, and establishes recommendations for future directions of software engineering, and, in particular, for the future role of formal methods in this area.
Proof rules for program verification rely on auxiliary assertions. We propose a (sound and relatively complete) proof rule whose auxiliary assertions are transition invariants. A transition invariant of a program is a...
详细信息
Proof rules for program verification rely on auxiliary assertions. We propose a (sound and relatively complete) proof rule whose auxiliary assertions are transition invariants. A transition invariant of a program is a binary relation over program states that contains the transitive closure of the transition relation of the program. A relation is disjunctively well-founded if it is a finite union of well-founded relations. We characterize the validity of termination or another liveness property by the existence of a disjunctively well-founded transition invariant. The main contribution of our proof rule lies in its potential for automation via abstract interpretation.
Web services are becoming important in applications from electronic commerce to application interoperation. While numerous efforts have focused on service composition, service selection among similar services from mul...
详细信息
Web services are becoming important in applications from electronic commerce to application interoperation. While numerous efforts have focused on service composition, service selection among similar services from multiple providers has not been addressed. Such issue is more serious when services are embraced in Grid platforms, which are usually resource-conscious. Experimental results show that our considerations are valid and our preliminary solution works well in our Globus grid network.
Conflict resolution is an important issue in knowledge representation and reasoning. A common idea of solving conflicts in reasoning is to introduce priorities in the underlying reasoning mechanism. This paper describ...
详细信息
Conflict resolution is an important issue in knowledge representation and reasoning. A common idea of solving conflicts in reasoning is to introduce priorities in the underlying reasoning mechanism. This paper describes an implementation of the propositional version of prioritized logic programs (PLPs) proposed by Zhang and Foo recently [7]. As a central part of the system development, in this paper we outline the basic structure of the system, discuss major algorithms of computing answer sets of PLPs and illustrate the system performance based on various testing samples.
Multi-adjoint logic programs generalise monotonic and residuated logic programs in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. As our approach h...
详细信息
Multi-adjoint logic programs generalise monotonic and residuated logic programs in that simultaneous use of several implications in the rules and rather general connectives in the bodies are allowed. As our approach has continuous fixpoint semantics, in this work, a procedural semantics is given for the paradigm of multi-adjoint logic programming and a completeness result is proved. Some applications which could benefit from this theoretical approach, such as threshold computation, fuzzy databases and general fuzzy resolution, are commented on.
We propose a robot architecture to integrate symbolic and non-symbolic information processings. Artificial neural networks (ANN) are quick, flexible and robust. Symbolic processing is on the other hand comprehensible,...
详细信息
We propose a robot architecture to integrate symbolic and non-symbolic information processings. Artificial neural networks (ANN) are quick, flexible and robust. Symbolic processing is on the other hand comprehensible, effective, controllable, and consistent. To integrate symbolic and non-symbolic methods, we consider the relation between a robot and its environment as constraints. To describe and solve such constraints we turn to constraint logic programming (CLP). To construct a robot that works in the complex environment, CLP and ANN are integrated into a unified framework such that CLP evaluates the behavior candidates proposed by ANN according to the constraints and ANN learns adequate behavior according to evaluations by CLP. We implemented the decision process in our robot that drove through a test course as we expected.
The object-oriented philosophy creates a powerful synergy throughout the development life-cycle by combining abstraction, encapsulation and modularity. However, existing object-oriented programming languages are low-l...
详细信息
The object-oriented philosophy creates a powerful synergy throughout the development life-cycle by combining abstraction, encapsulation and modularity. However, existing object-oriented programming languages are low-level procedural ones that are hard to program and debug. logic programming allows computing problems to be expressed in a high-level declarative way, without giving instructions on how the problem is to be solved. However, logic programming lacks powerful methods to model applications. In the past few decades, the integration of object-oriented programming and logic programming has attracted a lot of interest, with a number of languages being proposed, but these languages fail to address some key object-oriented features properly. In this paper, we introduce a novel object-oriented logic programming language that supports nearly all key object-oriented features in a logic programming framework. We also describe its operational semantics.
The aim of the paper is to show relationships between different formalisms for handling uncertainty in logic programming, knowledge based systems and deductive databases. Namely, we show that our model of fuzzy logic ...
详细信息
The aim of the paper is to show relationships between different formalisms for handling uncertainty in logic programming, knowledge based systems and deductive databases. Namely, we show that our model of fuzzy logic programming has the same expressive power as annotated logic programs with restricted continuous semantics. Features of fuzzy unification are achieved by extending the rule base by axioms of equality with fuzzy similarities. This induces a new fuzzy relational algebra. Our procedural semantics enables us to estimate truth values of the answers during the computation. Using this, we introduce a model with threshold computation and another for finding the best answer with prescribed precision tolerance.
暂无评论