In this paper we define a new clausal class, called BU, which can be decided by hyperresolution with splitting. We also consider the model generation problem for BU and show that hyperresolution plus splitting can als...
详细信息
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a 0computed answer is considered wrong by the user (error symptom), the debugger locates a program fragme...
详细信息
Mazurkiewicz traces are one of the simplest non-interleaving model of executions. For some systems the trace model may be exponentially smaller than the transition system model. This is one of the motivations for stud...
详细信息
In model checking one uses algorithmic techniques to establish thecorrectness of the design with respect to a given property. Model checking is based on a small number of key algorithmic ideas, tying together graph th...
详细信息
In model checking one uses algorithmic techniques to establish thecorrectness of the design with respect to a given property. Model checking is based on a small number of key algorithmic ideas, tying together graph theory, automata theory, and logic. In the last few years, this area has seen a dramatic expansion of activities. Today many companies cannot wait to get the most advanced tools available, and many of them have formed R&D groups to develop model checking tools and apply them to their own designs. Unfortunately, myths abound about the computational complexity of model checking. This talk will provide an overview of model checking from the perspective of computational complexity and will explain why such complexity pose a serious barrier to the broad applicability of model checking.
Dynamic logic programming (DLP) was introduced to deal with knowledge about changing worlds, by assigning semantics to sequences of generalized logic programs, each of which represents a state of the world. These stat...
详细信息
The system of the ELAN environment which is a rewriting logic environment based on ASF and SDF technology is demonstrated. Some of the characteristic features of ELAN are rewriting, AC-matching, and strategies to cont...
详细信息
The system of the ELAN environment which is a rewriting logic environment based on ASF and SDF technology is demonstrated. Some of the characteristic features of ELAN are rewriting, AC-matching, and strategies to control the non-determinism induced by non-confluent rewrite systems. The specificity of ELAN consists of integrating the two forms of non-determinism plus deterministic rule-based computations in the same environment. The development of ELAN specifications is supported by an environment which contains, among others, a parser, an interpreter, and a compiler.
It has become a crucial issue to assure the safety for air traffic control. We consider some air traffic accidents can be avoided by verifying the safety for air traffic control logically. In this paper, we propose a ...
详细信息
It has become a crucial issue to assure the safety for air traffic control. We consider some air traffic accidents can be avoided by verifying the safety for air traffic control logically. In this paper, we propose a theoretical framework for a logical safety verification for air traffic control based on a paraconsistent logic program called an Extended Vector Annotated logic Program with Strong Negation (EVALPSN for short). Compared to other kinds of safety verification such as safety verification for railway interlocking, the safety verification for air traffic control contains more uncertainty and sometimes has to deal with probabilistic datum. Therefore, we extend EVALPSN to probabilistic EVALPSN(P-EVALPSN for short) for dealing with the safety verification containing probability. We introduce the ideas of the safety verification based on both EVALPSN and P-EVALPSN with taking a simple example for landing clearance by air traffic controllers.
A neural approach to propositional multi-adjoint logic programming was recently introduced. In this paper we extend the neural approach to multi-adjoint deduction and, furthermore, modify it to cope with abductive mul...
详细信息
In this paper we present a declarative language that aims at combining valuable features of CLP languages - namely, nondeterminism, unification, constraint solving, dynamic data structures - with features of conventio...
详细信息
暂无评论