作者：
Barták, RCharles Univ
Fac Math & Phys Inst Theoret Comp Sci Prague Czech Republic
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP) and a generic solver finds a solutio...
详细信息
ISBN:
(纸本)3540255605
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP) and a generic solver finds a solution without additional programming. However, in practice, the situation is more complicated because there usually exist several ways how to model the problem as a CSP, that is using variables, their domains, and constraints. In fact, different constraint models may lead to significantly different running times of the solver so constraint modeling is a crucial part of problem solving. This paper describes some known approaches to efficient modeling with constraints in a tutorial-like form. The primary audience is practitioners, especially in logicprogramming, that would like to use constraints in their projects but do not have yet deep knowledge of constraint satisfaction techniques.
The proceedings contain 29 papers from the programming Languages and Systems - 14th European Symposium on programming, ESOP 2005, held as part of the Joint European Conference on theory and practice of Software, ETAPS...
详细信息
The proceedings contain 29 papers from the programming Languages and Systems - 14th European Symposium on programming, ESOP 2005, held as part of the Joint European Conference on theory and practice of Software, ETAPS 2005, Proceedings. The topics discussed include: programming with explicit security policies;trace partitioning in abstract interpretation based static analyzers;interprocedural hebrand equalities;a new foundation for control-dependence and slicing for modern program structures;determinacy inference for logic programs;automation verification of pointer programs using grammer-based shape analysis;and enforcing resource bounds via static verification of dynamic checks.
The transition between the supervisory control theory (SCT) and its implementation in programmable logic controllers (PLCs) is not straightforward. This is mainly due to the fact that the SCT is stated in an event-bas...
详细信息
The transition between the supervisory control theory (SCT) and its implementation in programmable logic controllers (PLCs) is not straightforward. This is mainly due to the fact that the SCT is stated in an event-based asynchronous setting whilst PLCs are signal-based, synchronous and sequential. Based on Petri nets, the PLC programming language sequential function chart (SFC) seems to be the ideal choice for this transition. However, the transition requires detailed knowledge of how the PLC and SFCs work. Different execution models for SFCs are presented and compared with the international standard IEC 61131-3. Often, the application of the SCT to a control problem results in a set of modules between which mutual exclusion and synchronisation are important aspects. The results indicate, however, that for modular SFC programs it seems generally impossible to simultaneously achieve both mutual exclusion between modules as well as synchronisation of modules without using workarounds that may be either manual or suffer from state space explosion. Nevertheless, one of the presented execution models, the immediate transit/ immediate action model, together with a handshaking procedure is shown to give a simple solution to both mutual exclusion and synchronisation. (c) 2004 Elsevier Ltd. All rights reserved.
The proceedings contain 115 papers. The topics discussed include: a description logic based ontology language;preference reasoning;symmetry definitions for constraint satisfaction problems;dynamic ordering for asynchr...
详细信息
ISBN:
(纸本)3540292381
The proceedings contain 115 papers. The topics discussed include: a description logic based ontology language;preference reasoning;symmetry definitions for constraint satisfaction problems;dynamic ordering for asynchronous backtracking on DisCSPs;incremental algorithms for local search from existential second-order logic;mind the gaps: a new splitting strategy for consistency techniques;a linear-logic semantics for constraint handling rules;ad-hoc global constraints for life;interval analysis in scheduling;planning and scheduling to minimize tardiness;applying constraint programming to rigid body protein docking;generating corrective explanations for interactive constraint satisfaction;and depth-first mini-bucket elimination.
Society is increasingly dependent on information and communication technol- ogy. Computers are integrated into everything from toasters to control systems for critical infrastructure. Consequently even simple programm...
Society is increasingly dependent on information and communication technol- ogy. Computers are integrated into everything from toasters to control systems for critical infrastructure. Consequently even simple programming errors have the potential to wreck havoc on practically every aspect of society and everyday life. It is therefore a crucial challenge for computer science to develop tools and techniques that can help improve the quality of software design and implemen- tation. In this dissertation it is argued that techniques rooted in the theory and practice of programming languages, so-called language-based safety and security, provide a feasible platform for developing software that can be verified and validated with a very high degree of assurance. Specifically, it is argued and demonstrated that static analysis is an indispensable technique for language- based safety and security and that the Flow logic framework for static analysis is particularly useful this regard. In order to support and illustrate the above points, a number of program analyses are developed for the Carmel programming language, a variant of the low-level language used on Java smart cards. The analyses are formally proved correct with respect to the semantics and are then used to verify a wide spectrum of pertinent safety and security properties.
We present the action language GC+ for reasoning about actions in multi-agent systems under probabilistic uncertainty and partial observability, which is an extension of the action language C+ that is inspired by part...
详细信息
ISBN:
(纸本)3540285385
We present the action language GC+ for reasoning about actions in multi-agent systems under probabilistic uncertainty and partial observability, which is an extension of the action language C+ that is inspired by partially observable stochastic games (POSGs). We provide a finite-horizon value iteration for this framework and show that it characterizes finite-horizon Nash equilibria. We also describe how the framework can be implemented on top of nonmonotonic causal theories. We then present acyclic action descriptions in GC+ as a special case where transitions are computable in polynomial time. We also give an example that shows the usefulness of our approach in practice.
In this paper, a rewrite theory for checking μ-calculus properties is developed. We use the same framework proposed in [11] and demonstrate how rewriting logic can be used as a unified formalism from model specificat...
详细信息
In many verification applications the desired outcome is that the formula is unsatisfiable: a satisfying assignment essentially exhibits a bug and unsatisfiability implies a lack of bugs, at least for the property bei...
详细信息
暂无评论