this paper contributes to the area of inductive logic programming by presenting a new learning framework that allows the learning of weak constraints in Answer Set programming (ASP). the framework, called Learning fro...
详细信息
this paper contributes to the area of inductive logic programming by presenting a new learning framework that allows the learning of weak constraints in Answer Set programming (ASP). the framework, called Learning from Ordered Answer Sets, generalises our previous work on learning ASP programs without weak constraints, by considering a new notion of examples as ordered pairs of partial answer sets that exemplify which answer sets of a learned hypothesis (together with a given background knowledge) are preferred to others. In this new learning task inductive solutions are searched within a hypothesis space of normal rules, choice rules, and hard and weak constraints. We propose a new algorithm, ILASP2, which is sound and complete with respect to our new learning framework. We investigate its applicability to learning preferences in an interview scheduling problem and also demonstrate that when restricted to the task of learning ASP programs without weak constraints, ILASP2 can be much more efficient than our previously proposed system.
the state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow models, withthe filtering of the bin p...
详细信息
ISBN:
(纸本)9783642153952
the state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow models, withthe filtering of the bin packing constraint. Our experiments show that we often obtain significant improvements in runtime. the DP-flow model is a novel formulation of the problem.
constraints shield solutions from a problem solver. However, in the hands of trained constraint problem solvers, the same constraints that create the problems in the first place can also guide problem solvers to solut...
详细信息
We study the problem of synthesizing recursive Datalog programs from examples. We propose a constraint-based synthesis approach that uses an SMT solver to efficiently navigate the space of Datalog programs and their c...
详细信息
ISBN:
(纸本)9783319661582;9783319661575
We study the problem of synthesizing recursive Datalog programs from examples. We propose a constraint-based synthesis approach that uses an SMT solver to efficiently navigate the space of Datalog programs and their corresponding derivation trees. We demonstrate our technique's ability to synthesize a range of graph-manipulating recursive programs from a small number of examples. In addition, we demonstrate our technique's potential for use in automatic construction of program analyses from example programs and desired analysis output.
the eplex library of the (ECLPSe)-P-i constraint Logic programming platform allows the integration of Mathematical programming techniques with its native constraint Logic programming techniques within the same unified...
详细信息
ISBN:
(纸本)3540292381
the eplex library of the (ECLPSe)-P-i constraint Logic programming platform allows the integration of Mathematical programming techniques with its native constraint Logic programming techniques within the same unified framework. It provides an interface to state-of-the-art Mathematical programming solvers, and a set of programming primitives that allow 'hybrid' techniques to be easily expressed. this paper presents these facilities, and discusses some associated implementation issues.
Recently, constraint-programming techniques have been used to generate test data and to verify the conformity of a program with its specification. constraint generated for these tasks may involve integer ranging on al...
详细信息
ISBN:
(纸本)9783540749691
Recently, constraint-programming techniques have been used to generate test data and to verify the conformity of a program with its specification. constraint generated for these tasks may involve integer ranging on all machine-integers, thus, the constraint-based modeling of the program and its specification is a critical issue. In this paper we investigate different models. We show that a straightforward translation of a program and its specification in a system of guarded constraints is ineffective. We outline the key role of Boolean abstractions and explore different search strategies on standard benchmarks.
In integer programming, cut generation is crucial for improving the tightness of the linear relaxation of the problem. this is relevant for weighted constraint satisfaction problems (WCSPs) in which we use approximate...
详细信息
ISBN:
(纸本)9783319661582;9783319661575
In integer programming, cut generation is crucial for improving the tightness of the linear relaxation of the problem. this is relevant for weighted constraint satisfaction problems (WCSPs) in which we use approximate dual feasible solutions to produce lower bounds during search. Here, we investigate using one class of cuts in WCSP: clique cuts. We show that clique cuts are likely to trigger suboptimal behavior in the specialized algorithms that are used in WCSP for generating dual bounds and show how these problems can be corrected. At the same time, the additional structure present in WCSP allows us to slightly generalize these cuts. Finally, we show that cliques exist in instances from several benchmark families and that exploiting them can lead to substantial performance improvement.
AES is a mainstream block cipher used in many protocols and whose resilience against attack is essential for cybersecurity. In [14], Oren and Wool discuss a Tolerant Algebraic Side-Channel Analysis (TASCA) and show ho...
详细信息
ISBN:
(纸本)9783319661582;9783319661575
AES is a mainstream block cipher used in many protocols and whose resilience against attack is essential for cybersecurity. In [14], Oren and Wool discuss a Tolerant Algebraic Side-Channel Analysis (TASCA) and show how to use optimization technology to exploit side-channel information and mount a computational attack against AES. this paper revisits the results and posits that constraintprogramming is a strong contender and a potent optimization solution. It extends bit-vector solving as introduced in [8], develops a CP and an IP model and compares them withthe original Pseudo-Boolean formulation. the empirical results establish that CP can deliver solutions with orders of magnitude improvement in both run time and memory usage, traits that are essential to potential adoption by cryptographers.
While incremental propagation for global constraints is recognized to be important, little research has been devoted to how propagator-centered constraintprogramming systems should support incremental propagation. th...
详细信息
ISBN:
(纸本)9783540749691
While incremental propagation for global constraints is recognized to be important, little research has been devoted to how propagator-centered constraintprogramming systems should support incremental propagation. this paper introduces advisors as a simple and efficient, yet widely applicable method for supporting incremental propagation in a propagator-centered setting. the paper presents how advisors can be used for achieving different forms of incrementality and evaluates cost and benefit for several global constraints.
暂无评论