Zobrazeno 1 - 10
of 51
pro vyhledávání: '"Drescher, Christian"'
Autor:
Sprave, Joachim, Drescher, Christian
This paper addresses the problem of evaluating the quality of finite element meshes for the purpose of structural mechanic simulations. It proposes the application of a machine learning model trained on data collected from expert evaluations. The tas
Externí odkaz:
http://arxiv.org/abs/2107.10507
Autor:
Studer, Stefan, Bui, Thanh Binh, Drescher, Christian, Hanuschkin, Alexander, Winkler, Ludwig, Peters, Steven, Mueller, Klaus-Robert
Machine learning is an established and frequently used technique in industry and academia but a standard process model to improve success and efficiency of machine learning applications is still missing. Project organizations and machine learning pra
Externí odkaz:
http://arxiv.org/abs/2003.05155
Autor:
Drescher, Christian, Walsh, Toby
Many native ASP solvers exploit unfounded sets to compute consequences of a logic program via some form of well-founded negation, but disregard its contrapositive, well-founded justification (WFJ), due to computational cost. However, we demonstrate t
Externí odkaz:
http://arxiv.org/abs/1308.3923
Autor:
Drescher, Christian, Walsh, Toby
We solve constraint satisfaction problems through translation to answer set programming (ASP). Our reformulations have the property that unit-propagation in the ASP solver achieves well defined local consistency properties like arc, bound and range c
Externí odkaz:
http://arxiv.org/abs/1104.3927
Heterogeneous nonmonotonic multi-context systems (MCS) permit different logics to be used in different contexts, and link them via bridge rules. We investigate the role of symmetry detection and symmetry breaking in such systems to eliminate symmetri
Externí odkaz:
http://arxiv.org/abs/1104.3931
Autor:
Drescher, Christian, Walsh, Toby
We show that global constraints on finite domains like all-different can be reformulated into answer set programs on which we achieve arc, bound or range consistency. These reformulations offer a number of other advantages beyond providing the power
Externí odkaz:
http://arxiv.org/abs/1008.5029
Autor:
Drescher, Christian
In the context of answer set programming, this work investigates symmetry detection and symmetry breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We contribute a reduction of symmetry detection to
Externí odkaz:
http://arxiv.org/abs/1008.5033
In the context of Answer Set Programming, this paper investigates symmetry-breaking to eliminate symmetric parts of the search space and, thereby, simplify the solution process. We propose a reduction of disjunctive logic programs to a coloured digra
Externí odkaz:
http://arxiv.org/abs/1008.1809
Autor:
Drescher, Christian, Walsh, Toby
Publikováno v:
Theory and Practice of Logic Programming, 10(4-6), 465-480, 2010
We present a new approach to enhancing Answer Set Programming (ASP) with Constraint Processing techniques which allows for solving interesting Constraint Satisfaction Problems in ASP. We show how constraints on finite domains can be decomposed into l
Externí odkaz:
http://arxiv.org/abs/1007.4114
Publikováno v:
Proceedings of the Twelfth International Workshop on Nonmonotonic Reasoning (2008) 141-149
Modern solvers for Boolean Satisfiability (SAT) and Answer Set Programming (ASP) are based on sophisticated Boolean constraint solving techniques. In both areas, conflict-driven learning and related techniques constitute key features whose applicatio
Externí odkaz:
http://arxiv.org/abs/1005.1716