Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Roman Barták
2010 – today
- 2013
[j20]Roman Barták, Radomír Cernoch, Ondrej Kuzelka, Filip Zelezný: Formulating the template ILP consistency problem as a constraint satisfaction problem. Constraints 18(2): 144-165 (2013)- 2012
- [c61]Rudolf Kadlec, Csaba Tóth, Martin Cerný, Roman Barták, Cyril Brom: Planning Is the Game: Action Planning as a Design Tool and Game Mechanism. AIIDE 2012
- [c60]Andrej Chovanec, Roman Barták: Decomposition, Merging, and Refinement Approach to Boost Inductive Logic Programming Algorithms. AIMSA 2012: 184-194
- [c59]Roman Barták, Milan Jaska, Ladislav Novak, Vladimír Rovenský, Tomás Skalický, Martin Cully, Con Sheahan, Thanh-Tung Dang: FlowOpt: Bridging the Gap Between Optimization Technology and Manufacturing Planners. ECAI 2012: 1003-1004
- [c58]Roman Barták, Filip Dvorak, Jakub Gemrot, Cyril Brom, Daniel Toropila: When Planning Should Be Easy: On Solving Cumulative Planning Problems. FLAIRS Conference 2012
- [c57]Roman Barták: On Complexity of Verifying Nested Workflows with Extra Constraints. ICAART (1) 2012: 346-354
- [c56]Daniel Toropila, Filip Dvorak, Otakar Trunda, Martin Hanes, Roman Barták: Three Approaches to Solve the Petrobras Challenge: Exploiting Planning Techniques for Solving Real-Life Logistics Problems. ICTAI 2012: 191-198
- [c55]Tomas Balyo, Roman Barták, Pavel Surynek: Shortening Plans by Local Re-planning. ICTAI 2012: 1022-1028
- [c54]Roman Barták, Vladimír Rovenský: Verifying Nested Workflows with Extra Constraints. MICAI (1) 2012: 359-370
- [c53]Tomas Balyo, Roman Barták, Pavel Surynek: On Improving Plan Quality via Local Enhancements. SOCS 2012
- [c52]Roman Barták, Con Sheahan, Ann Sheahan: MAK€- A System for Modelling, Optimising, and Analyzing Production in Small and Medium Enterprises. SOFSEM 2012: 600-611
- 2011
- [j19]Roman Barták, Miguel A. Salido: Constraint satisfaction for planning and scheduling problems. Constraints 16(3): 223-227 (2011)
- [c51]
- [c50]Roman Barták, Michal Zerola, Stanislav Slusny: Towards Routing for Autonomous Robots - Using Constraint Programming in an Anytime Path Planner. ICAART (1) 2011: 313-320
- [c49]Andrej Chovanec, Roman Barták: Boosting Inductive Logic Programming via Decomposition, Merging, and Refinement. ICTAI 2011: 914-915
- [c48]Andrej Chovanec, Roman Barták: On Generating Templates for Hypothesis in Inductive Logic Programming. MICAI (1) 2011: 162-173
- [c47]Roman Barták: On Constraint Models for Parallel Planning: The Novel Transition Scheme. SCAI 2011: 50-59
- 2010
- [j18]Roman Barták, Simone Fratini, Lee McCluskey: The Third Competition on Knowledge Engineering for Planning and Scheduling. AI Magazine 31(1): 95-98 (2010)
- [j17]Toshinori Munakata, Roman Barták: Logic programming for combinatorial problems. Artif. Intell. Rev. 33(1-2): 135-150 (2010)
- [j16]Roman Barták, Ondrej Cepek, Pavel Surynek: Discovering implied constraints in precedence graphs with alternatives. Annals OR 180(1): 233-263 (2010)
- [j15]Roman Barták, Daniel Toropila: Solving Sequential Planning Problems via Constraint Satisfaction. Fundam. Inform. 99(2): 125-145 (2010)
- [j14]Roman Barták, Amedeo Cesta, Lee McCluskey, Miguel A. Salido: Preface to special issue on planning and scheduling. Knowledge Eng. Review 25(3): 247-248 (2010)
- [j13]Roman Barták, Miguel A. Salido, Francesca Rossi: New trends in constraint satisfaction, planning, and scheduling: a survey. Knowledge Eng. Review 25(3): 249-279 (2010)
- [j12]Roman Barták, Hana Rudová: Special issue on applications and methodologies for planning and scheduling: editorial. J. Scheduling 13(4): 299-300 (2010)
- [c46]Roman Barták, Ondrej Kuzelka, Filip Zelezný: Formulating Template Consistency in Inductive Logic Programming as a Constraint Satisfaction Problem. Abstraction, Reformulation, and Approximation 2010
- [c45]Roman Barták: Constraint Models for Reasoning on Unification in Inductive Logic Programming. AIMSA 2010: 101-110
- [c44]Roman Barták, Ondrej Kuzelka, Filip Zelezný: Using Constraint Satisfaction for Learning Hypotheses in Inductive Logic Programming. FLAIRS Conference 2010
- [c43]
- [c42]
2000 – 2009
- 2009
- [c41]
- [c40]Roman Barták: Special Track on Artificial Intelligence Planning and Scheduling. FLAIRS Conference 2009
- [c39]Roman Barták, Daniel Toropila: Enhancing Constraint Models for Planning Problems. FLAIRS Conference 2009
- [c38]Michal Zerola, Michal Sumbera, Jérôme Lauret, Roman Barták: Efficient multi-site data movement in distributed environment. GRID 2009: 171-172
- [c37]Michal Zerola, Michal Sumbera, Roman Barták, Jérôme Lauret: Using Constraint Programming to Plan Efficient Data Movement on the Grid. ICTAI 2009: 729-733
- [c36]Roman Barták, Daniel Toropila: Revisiting Constraint Models for Planning Problems. ISMIS 2009: 582-591
- [c35]Roman Barták, Daniel Toropila: Integrating Constraint Models for Sequential and Partial-Order Planning. SARA 2009
- [c34]Lukás Chrpa, Roman Barták: Reformulating Planning Problems by Eliminating Unpromising Actions. SARA 2009
- [r1]
- [i6]Michal Zerola, Jérôme Lauret, Roman Barták, Michal Sumbera: Using constraint programming to resolve the multi-source/multi-site data movement paradigm on the Grid. CoRR abs/0901.0148 (2009)
- [i5]Michal Zerola, Jérôme Lauret, Roman Barták, Michal Sumbera: Efficient Multi-site Data Movement Using Constraint Programming for Data Hungry Science. CoRR abs/0906.2914 (2009)
- 2008
- [j11]Roman Barták: Rina Dechter , Constraint Processing, Morgan Kaufmann Publisher (2003) ISBN 1-55860-890-7, Francesca Rossi, Peter van Beek and Toby Walsh, Editors, Handbook of Constraint Programming, Elsevier (2006) ISBN 978-0-444-52726-4. Computer Science Review 2(2): 123-130 (2008)
- [j10]Miguel A. Salido, Antonio Garrido, Roman Barták: Introduction: Special issue on constraint satisfaction techniques for planning and scheduling problems. Eng. Appl. of AI 21(5): 679-682 (2008)
- [j9]Roman Barták, Ondrej Cepek: Incremental Filtering Algorithms for Precedence and Dependency Constraints. International Journal on Artificial Intelligence Tools 17(1): 205-221 (2008)
- [c33]Roman Barták, Ondrej Cepek: Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models. AIMSA 2008: 235-246
- [c32]Roman Barták, Daniel Toropila: Reformulating Constraint Models for Classical Planning. FLAIRS Conference 2008: 525-530
- [c31]Lukás Chrpa, Roman Barták: Towards Getting Domain Knowledge: Plans Analysis through Investigation of Actions Dependencies. FLAIRS Conference 2008: 531-536
- [c30]Roman Barták, Ondrej Cepek: Nested temporal networks with alternatives: recognition and tractability. SAC 2008: 156-157
- [c29]Lukás Chrpa, Roman Barták: Looking for Planning Problems Solvable in Polynomial Time via Investigation of Structures of Action Dependencies. SCAI 2008: 175-180
- 2007
- [j8]Roman Barták, Lee McCluskey: Introduction to the Special Issue on Knowledge Engineering Tools and Techniques for Automated Planning and Scheduling Systems. Knowledge Eng. Review 22(2): 115-116 (2007)
- [c28]Roman Barták, Ondrej Cepek, Martin Hejna: Temporal Reasoning in Nested Temporal Networks with Alternatives. CSCLP 2007: 17-31
- [c27]Pavel Surynek, Roman Barták: Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search. FLAIRS Conference 2007: 134-139
- [c26]Roman Barták, Ondrej Cepek: Temporal Networks with Alternatives: Complexity and Model. FLAIRS Conference 2007: 641-646
- [c25]
- 2006
- [j7]Roman Barták, Lee McCluskey: The First Competition on Knowledge Engineering for Planning and Scheduling. AI Magazine 27(1): 97-98 (2006)
- [j6]Roman Barták, Michela Milano: Introduction to the Special Issue on the Integration of AI and OR Techniques in CP for Combinatorial Optimization (CPAIOR 2005). Constraints 11(4): 269-270 (2006)
- [c24]Roman Barták, Ondrej Cepek: Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach. ICAPS 2006: 350-353
- [c23]Roman Barták, Ondrej Cepek: A Constraint Model for State Transitions in Disjunctive Resources. CSCLP 2006: 48-62
- [c22]Roman Barták: Incremental Propagation of Time Windows on Disjunctive Resources. FLAIRS Conference 2006: 25-30
- [c21]Roman Barták, Ondrej Cepek: Incremental Filtering Algorithms for Precedence and Dependency Constraints. ICTAI 2006: 416-426
- [i4]Timothy Atkinson, Roman Barták, Marius-Calin Silaghi, E. Tuleu, Markus Zanker: Private and Efficient Stable Marriages (Matching). IACR Cryptology ePrint Archive 2006: 345 (2006)
- 2005
- [j5]Roman Barták: R. Dechter, Constraint Processing, Morgan Kaufmann (2003). Artif. Intell. 169(2): 142-145 (2005)
- [j4]Petr Vilím, Roman Barták, Ondrej Cepek: Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities. Constraints 10(4): 403-425 (2005)
- [c20]
- [c19]
- [c18]Josef Zlomek, Roman Barták: Full Arc Consistency in WCSP and in Constraint Hierarchies with Finite Domains. CP 2005: 876
- [c17]
- [c16]Roman Barták, Pavel Surynek: An Improved Algorithm for Maintaining Arc Consistency in Dynamic Constraint Satisfaction Problems. FLAIRS Conference 2005: 161-166
- [c15]Marius-Calin Silaghi, Amit Abhyankar, Markus Zanker, Roman Barták: Desk-Mates (Stable Matching) with Privacy of Preferences, and a New Distributed CSP Framework. FLAIRS Conference 2005: 671-677
- [c14]Roman Barták, Hana Rudová: Limited assignments: a new cutoff strategy for incomplete depth-first search. SAC 2005: 388-392
- [e1]Roman Barták, Michela Milano (Eds.): Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 30 - June 1, 2005, Proceedings. Lecture Notes in Computer Science 3524, Springer 2005, ISBN 3-540-26152-4
- 2004
- [j3]Roman Barták: The CP-04 Workshop on CSP Techniques with Immediate Application (Conference Report). IEEE Intelligent Informatics Bulletin 4: 3 (2004)
- [c13]Petr Vilím, Roman Barták, Ondrej Cepek: Unary Resource Constraint with Optional Activities. CP 2004: 62-76
- [c12]Pavel Surynek, Roman Barták: A New Algorithm for Maintaining Arc Consistency After Constraint Retraction. CP 2004: 767-771
- [c11]Roman Barták, Radek Erben: A New Algorithm for Singleton Arc Consistency. FLAIRS Conference 2004: 257-262
- [c10]Tomás Müller, Hana Rudová, Roman Barták: Minimal Perturbation Problem in Course Timetabling. PATAT 2004: 126-146
- [c9]
- 2003
- [j2]Roman Barták: Dynamic Global Constraints in Backtracking Based Environments. Annals OR 118(1-4): 101-119 (2003)
- [c8]
- [c7]Roman Barták, Tomás Müller, Hana Rudová: A New Approach to Modeling and Solving Minimal Perturbation Problems. CSCLP 2003: 233-249
- 2002
- [c6]Petr Vilím, Roman Barták: Filtering Algorithms for Batch Processing with Sequence Dependent Setup Times. AIPS 2002: 312-321
- [c5]Roman Barták: Visopt ShopFloor: Going Beyond Traditional Scheduling. International Workshop on Constraint Solving and Constraint Logic Programming 2002: 185-199
- [c4]
- [c3]
- [c2]
- 2001
- [i3]
- [i2]
- [i1]Krzysztof R. Apt, Roman Barták, Eric Monfroy, Francesca Rossi, Sebastian Brand (Eds.): Proceedings of the 6th Annual Workshop of the ERCIM Working Group on Constraints. CoRR cs.PL/0110012 (2001)
- 2000
- [j1]Roman Barták: Conceptual Models for Combined Planning and Scheduling. Electronic Notes in Discrete Mathematics 4: 1 (2000)
1990 – 1999
- 1999
- [c1]Roman Barták: Dynamic Constraint Models for Planning and Scheduling Problems. New Trends in Constraints 1999: 237-255
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-16 21:32 CEST by the dblp team