Zobrazeno 1 - 10
of 176
pro vyhledávání: '"Maurice Bruynooghe"'
Publikováno v:
Analysis, Verification and Transformation for Declarative Programming and Intelligent Systems ISBN: 9783031314759
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc37c68250e86ce11d3a55ece5793090
https://doi.org/10.1007/978-3-031-31476-6_9
https://doi.org/10.1007/978-3-031-31476-6_9
Aggregates provide a concise way to express complex knowledge. The problem of selecting an appropriate formalisation of aggregates for answer set programming (ASP) remains unsettled. This paper revisits it from the viewpoint of Approximation Fixpoint
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::78a4ba14d81eb50907846d8550e34bd6
https://lirias.kuleuven.be/handle/20.500.12942/703450
https://lirias.kuleuven.be/handle/20.500.12942/703450
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783030393212
VMCAI
VMCAI
Parity games are infinite two-player games played on node-weighted directed graphs. Formal verification problems such as verifying and synthesizing automata, bounded model checking of LTL, CTL*, propositional µ-calculus, ...reduce to problems over p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::70344d10c1dc92e0b36ebdb9e1e33e86
https://doi.org/10.1007/978-3-030-39322-9_21
https://doi.org/10.1007/978-3-030-39322-9_21
Publikováno v:
AI Magazine; Vol 37, No 3: Fall 2016; 69-80
In Answer Set Programming (ASP), programs can be viewed as specifications of finite Herbrand structures. Other logics can be (and, in fact, were) used towards the same end and can be taken as the basis of declarative programming systems of similar fu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::594958a7bed66718da67cce63b6839e6
https://doi.org/10.1609/aimag.v37i3.2679
https://doi.org/10.1609/aimag.v37i3.2679
Publikováno v:
Theory and Practice of Logic Programming. 16:636-652
Symmetry in combinatorial problems is an extensively studied topic. We continue this research in the context of model expansion problems, with the aim of automating the workflow of detecting and breaking symmetry. We focus on local domain symmetry, w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::59cb2654f00a0211446b777ee60bd00b
https://doi.org/10.1017/s1471068416000508
https://doi.org/10.1017/s1471068416000508
Publikováno v:
Theory and Applications of Satisfiability Testing – SAT 2017 ISBN: 9783319662626
SAT
SAT
© Springer International Publishing AG 2017. The presence of symmetry in Boolean satisfiability (SAT) problem instances often poses challenges to solvers. Currently, the most effective approach to handle symmetry is by static symmetry breaking, whic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3ead094690ccfe98cf797949e3d62b1b
https://doi.org/10.1007/978-3-319-66263-3_6
https://doi.org/10.1007/978-3-319-66263-3_6
Autor:
Broes De Cat, Maurice Bruynooghe
Publikováno v:
Theory and Practice of Logic Programming. 13:471-485
Recent work in Answer Set Programming has integrated ideas from Constraint Programming. This has led to a new field called ASP Modulo CSP (CASP), in which the ASP language is enriched with constraint atoms representing constraint satisfaction problem
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::428db011f6ca56e945c210a439a1511f
https://doi.org/10.1017/s147106841300029x
https://doi.org/10.1017/s147106841300029x
Publikováno v:
Theory and Applications of Satisfiability Testing – SAT 2016 ISBN: 9783319409696
SAT
SAT
An effective SAT preprocessing technique is the construction of symmetry breaking formulas: auxiliary clauses that guide a SAT solver away from needless exploration of symmetric subproblems. However, during the past decade, state-of-the-art SAT solve
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3f485bec51d182ca5f36642aa97c9af9
https://doi.org/10.1007/978-3-319-40970-2_8
https://doi.org/10.1007/978-3-319-40970-2_8
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319409696
Theory and Applications of Satisfiability Testing – SAT 2016
Theory and Applications of Satisfiability Testing – SAT 2016
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::674eaf4772558fccb0eecc4cd033f4dd
https://doi.org/10.1007/978-3-319-40970-2
https://doi.org/10.1007/978-3-319-40970-2
Publikováno v:
Computer Aided Verification ISBN: 9783642026577
CAV
CAV
Designers often apply manual or semi-automatic loop and data transformations on array and loop intensive programs to improve performance. The transformations should preserve the functionality, however, and this paper presents an automatic method for
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ac16f8d0c3bb56a97bf1ad2c3d44394b
https://doi.org/10.1145/2362389.2362390
https://doi.org/10.1145/2362389.2362390