the proceedings contain 23 papers. the topics discussed include: user-definable rule priorities for CHR;detecting defects in Erlang programs using static analysis;practical use of polynomials over the reals in proofs ...
详细信息
ISBN:
(纸本)1595937692
the proceedings contain 23 papers. the topics discussed include: user-definable rule priorities for CHR;detecting defects in Erlang programs using static analysis;practical use of polynomials over the reals in proofs of termination;type safe dynamic linking for JVM access control;systematic generation of glass-box test cases for functional logic programs;mechanized metatheory model-checking;relational semantics for effect-based program transformations with dynamic allocation;higher-order semantic labelling for inductive datatype systems;observing intermediate structures in a parallel lazy functional language;computing with subspaces;real-time rewriting semantics of orc;a larger decidable semiunification problem;local reasoning about storable locks;induction for positive almost sure termination;unfolding in CHR;and nonmonotonic inductive logic programming by instance patterns.
the proceedings contain 20 papers. the topics discussed include: Quarantine: a framework to mitigate memory errors in JNI applications;portable and accurate collection of calling-context-sensitive byte-code metrics fo...
ISBN:
(纸本)9781450309356
the proceedings contain 20 papers. the topics discussed include: Quarantine: a framework to mitigate memory errors in JNI applications;portable and accurate collection of calling-context-sensitive byte-code metrics for the Java virtual machine;the Java virtual machine in retargetable, high-performance instruction set simulation;a DSL for writing type systems for Xtext languages, space-based multi-core programming in Java;Habanero-Java: the new adventures of old X10;ejIP: a TCP/IP stack for embedded Java;the soul tool suite for querying programs in symbiosis with Eclipse;Jazz2: a flexible and extensible framework for structural testing;object reuse and behavior adaptation in Java-like languages;trace-based compilation for the Java hotspot virtual machine;tool demonstration: overseer - low-level hardware monitoring and management for java;and optimized memory management for class metadata in a JVM.
this paper introduces CHRrp: constraint Handling Rules with user-definable rule priorities. CHRrp offers flexible execution control which is lacking in CHR. A formal operational semantics for the extended language is ...
详细信息
We study a generalization of the constraint satisfaction problem (CSP), the periodic constraint satisfaction problem. An input instance of the periodic CSP is a finite set of "generating" constraints over a ...
详细信息
We study a generalization of the constraint satisfaction problem (CSP), the periodic constraint satisfaction problem. An input instance of the periodic CSP is a finite set of "generating" constraints over a structured variable set that implicitly specifies a larger, possibly infinite set of constraints;the problem is to decide whether or not the larger set of constraints has a satisfying assignment. this model is natural for studying constraint networks consisting of constraints obeying a high degree of regularity or symmetry. Our main contribution is the identification of two broad polynomial-time tractable subclasses of the periodic CSP.
Previous studies have demonstrated that designing special purpose constraint propagators can significantly improve the efficiency of a constraintprogramming approach. In this paper we present an efficient algorithm f...
详细信息
Previous studies have demonstrated that designing special purpose constraint propagators can significantly improve the efficiency of a constraintprogramming approach. In this paper we present an efficient algorithm for bounds consistency propagation of the generalized cardinality constraint (gcc). Using a variety of benchmark and random problems, we show that on some problems our bounds consistency algorithm can dramatically outperform existing state-of-the-art commercial implementations of constraint propagators for the gcc. We also present a new algorithm for domain consistency propagation of the gcc which improves on the worst-case performance of the best previous algorithm for problems that occur often in applications.
COMET is an object-oriented language supporting a constraint-based architecture for local search through declarative and search components. this paper proposes three novel and lightweight control abstractions for the ...
详细信息
COMET is an object-oriented language supporting a constraint-based architecture for local search through declarative and search components. this paper proposes three novel and lightweight control abstractions for the search component, significantly enhancing the compositionality, modularity, and reuse of COMET programs. these abstractions, which includes events and checkpoints, rely on first-class closures as the enabling technology. they are especially useful for expressing, in a modular way, heuristic and meta-heuristics, unions of heterogeneous neighborhoods, and sequential composition of neighborhoods.
Modeling and programming tools for neighborhood search often support invariants, i.e., data structures specified declaratively and automatically maintained incrementally under changes. this paper considers invariants ...
详细信息
Modeling and programming tools for neighborhood search often support invariants, i.e., data structures specified declaratively and automatically maintained incrementally under changes. this paper considers invariants for longest paths in directed acyclic graphs, a fundamental abstraction for many applications. It presents bounded incremental algorithms for arc insertion and deletion which run in O ( ||delta|| + |delta| log |delta|) time and O ( ||delta||) time respectively, where |delta| and ||delta|| are measures of the change in the input and output. the paper also shows how to generalize the algorithm to various classes of multiple insertions/ deletions encountered in scheduling applications. Preliminary experimental results show that the algorithms behave well in practice.
this special issue of theory and practice of Logic programming (TPLP) contains the regular papers accepted for presentation at the 33rd internationalconference on Logic programming (ICLP 2017), held in Melbourne, Aus...
详细信息
this special issue of theory and practice of Logic programming (TPLP) contains the regular papers accepted for presentation at the 33rd internationalconference on Logic programming (ICLP 2017), held in Melbourne, Australia from the 28th of August to the 1st of September, 2017. ICLP 2017 was colocated withthe 23rd internationalconference on principles and practice of constraintprogramming (CP 2017) and the 20thinternationalconference on theory and Applications of Satisfiability Testing (SAT 2017). Since the first conference held in Marseille in 1982, ICLP has been the premier international event for presenting research in logic programming.
暂无评论