Linear temporal logic (LTL) has been widely used for specification and verification of reactive systems. Its standard model is sequences of states (or state transitions), and formulas describe sequencing of state tran...
详细信息
The following problem will be considered: from scattered examples on the behavior of a dynamic system induce a description of the system. For the induced description to be concise and modular, we use a generic action ...
详细信息
Partial evaluation is a program transformation that automatically specializes a program with respect to invariants. Despite successful application in areas such as graphics, operating systems, and software engineering...
详细信息
Partial evaluation is a program transformation that automatically specializes a program with respect to invariants. Despite successful application in areas such as graphics, operating systems, and software engineering, partial evaluators have yet to achieve widespread use. One reason is the difficulty of adequately describing specialization opportunities. Indeed, underspecialization or overspecialization often occurs, without any feedback as to the source of the problem. We have developed a high-level, module-based language allowing the program developer to guide the choice of both the code to specialize and the invariants to exploit during the specialization process. To ease the use of partial evaluation, the syntax of this language is similar to the declaration syntax of the target language of the partial evaluator. To provide feedback, declarations are checked during the analyses performed by partial evaluation. The language has been successfully used by a variety of users, including students having no previous experience with partial evaluation.
This paper studies computational issues related to the problem of reasoning about actions and change (RAC) by exploiting its link with the Answer Set programming paradigm. It investigates how increasing the expressive...
详细信息
ISBN:
(纸本)9783540207214
This paper studies computational issues related to the problem of reasoning about actions and change (RAC) by exploiting its link with the Answer Set programming paradigm. It investigates how increasing the expressiveness of a RAC formalism so that it can capture the three major problems of frame, ramification and qualification, affects its computational complexity, and how a solution to these problems can be implemented within Answer Set programming. Our study is carried out within the particular language Ε. It establishes a link between language Ε and Answer Set programming by presenting encodings of different versions of this language into logic programs under the answer set semantics. This provides a computational realization of solutions to problems related to reasoning about actions and change, that can make use of the recent development of effective systems for Answer Set programming.
We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled logic programs to be performed withou...
详细信息
ISBN:
(纸本)1581138199
We introduce just enough tabling (JET), a mechanism to suspend and resume the tabled execution of logic programs at an arbitrary point. In particular, JET allows pruning of tabled logic programs to be performed without resorting to any recomputation. We discuss issues that are involved in supporting pruning in tabled resolution, how re-execution of tabled computations which were previously pruned can be avoided, and we describe the implementation of such a scheme based on an abstract machine like CHAT, which implements the suspension/resumption support that tabling requires through a combination of freezing and copying of execution states of suspended computations. Properties of just enough tabling and possible uses of the JET mechanism in a tabling system are also briefly discussed.
Since the seminal work of Zhou Chaochen, M. R. Hansen, and P. Sestoft on decidability of dense-time Duration Calculus [ZHS93] it is well known that decidable fragments of Duration Calculus can only be obtained through...
详细信息
We propose Concurrent Transaction Frame logic (CTFL) as a language to provide formal semantics to UML activity and class diagrams. CTFL extends first-order Horn logic with object-oriented class hierarchy and object de...
详细信息
This paper presents a completeness result, with respect to a possible world semantics, for a combination of a first-order temporal logic and neighbourhood logic. This logic was considered by Qiu and Zhou (1998, Procee...
详细信息
This paper describes a rule-based multiset programming paradigm, as a unifying theme for biological, chemical, DNA, physical and molecular computations. The computations are interpreted as the outcome arising out of d...
详细信息
ISBN:
(纸本)1581137419
This paper describes a rule-based multiset programming paradigm, as a unifying theme for biological, chemical, DNA, physical and molecular computations. The computations are interpreted as the outcome arising out of deterministic, nondeterministic or stochastic interaction among elements in a multiset object space which includes the environment. These interactions are like chemical reactions and the evolution of the multiset can mimic the biological evolution. Since the reaction rules are inherently parallel, any number of actions can be performed cooperatively or competitively among the subsets of elements, so that the elements evolve toward an equilibrium or an emergent state. Hence, this paradigm is widely applicable;e.g., to conventional algorithms, evolutionary algorithms, Markov chain Monte Carlo based Bayesian inference, genetic algorithms, self-organized criticality and active walker models (swarm and ant intelligence), DNA and molecular computing. Practical realisation of this paradigm is achieved through a coordination programming language using Multiset and transactions. This paradigm permits carrying out parts or all of the computations independently on distinct processors and is eminently suitable for cluster and grid computing.
The main contribution of this paper is the definition of the preference description language PDL. This language allows us to combine qualitative and quantitative, penalty based preferences in a flexible way. This make...
详细信息
暂无评论