Roman Barták - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Constraint satisfaction for planning and scheduling problemsRoman Barták, Miguel A. Salido. constraints, 16(3):223-227, 2011. [doi]

Towards Routing for Autonomous Robots - Using Constraint Programming in an Anytime Path PlannerRoman Barták, Michal Zerola, Stanislav Slusny. icaart 2011: 313-320

A Novel Constraint Model for Parallel PlanningRoman Barták. flairs 2011: [doi]

2010

Special issue on applications and methodologies for planning and scheduling: editorialRoman Barták, Hana Rudová. scheduling, 13(4):299-300, 2010. [doi]

Preface to special issue on planning and schedulingRoman Barták, Amedeo Cesta, Lee McCluskey, Miguel A. Salido. ker, 25(3):247-248, 2010. [doi]

The Third Competition on Knowledge Engineering for Planning and SchedulingRoman Barták, Simone Fratini, Lee McCluskey. aim, 31(1):95-98, 2010. [doi]

Optimizing Alternatives in Precedence NetworksRoman Barták. micai 2010: 197-208 [doi]

Discovering implied constraints in precedence graphs with alternativesRoman Barták, Ondrej Cepek, Pavel Surynek. anor, 180(1):233-263, 2010. [doi]

New trends in constraint satisfaction, planning, and scheduling: a surveyRoman Barták, Miguel A. Salido, Francesca Rossi. ker, 25(3):249-279, 2010. [doi]

Solving Sequential Planning Problems via Constraint SatisfactionRoman Barták, Daniel Toropila. FUIN, 99(2):125-145, 2010. [doi]

Using Constraint Satisfaction for Learning Hypotheses in Inductive Logic ProgrammingRoman Barták, Ondrej Kuzelka, Filip Zelezný. flairs 2010: [doi]

Constraint Models for Reasoning on Unification in Inductive Logic ProgrammingRoman Barták. aimsa 2010: 101-110 [doi]

Integrating Time and Resources into PlanningFilip Dvorak, Roman Barták. ictai 2010: 71-78 [doi]

2009

2008

Nested Precedence Networks with Alternatives: Recognition, Tractability, and ModelsRoman Barták, Ondrej Cepek. aimsa 2008: 235-246 [doi]

Nested temporal networks with alternatives: recognition and tractabilityRoman Barták, Ondrej Cepek. SAC 2008: 156-157 [doi]

Incremental Filtering Algorithms for Precedence and Dependency ConstraintsRoman Barták, Ondrej Cepek. ijait, 17(1):205-221, 2008. [doi]

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-4Roman Barták. csr, 2(2):123-130, 2008. [doi]

Reformulating Constraint Models for Classical PlanningRoman Barták, Daniel Toropila. flairs 2008: 525-530

Looking for Planning Problems Solvable in Polynomial Time via Investigation of Structures of Action DependenciesLukás Chrpa, Roman Barták. scai 2008: 175-180 [doi]

Towards Getting Domain Knowledge: Plans Analysis through Investigation of Actions DependenciesLukás Chrpa, Roman Barták. flairs 2008: 531-536

Introduction: Special issue on constraint satisfaction techniques for planning and scheduling problemsMiguel A. Salido, Antonio Garrido, Roman Barták. eaai, 21(5):679-682, 2008. [doi]

2007

2006

2005

On Generators of Random Quasigroup ProblemsRoman Barták. csclp 2006: 164-178 [doi]

Limited assignments: a new cutoff strategy for incomplete depth-first searchRoman Barták, Hana Rudová. SAC 2005: 388-392 [doi]

R. Dechter, Constraint Processing, Morgan Kaufmann (2003)Roman Barták. ai, 169(2):142-145, 2005. [doi]

An Improved Algorithm for Maintaining Arc Consistency in Dynamic Constraint Satisfaction ProblemsRoman Barták, Pavel Surynek. flairs 2005: 161-166

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, ProceedingsRoman Barták, Michela Milano, editors, Volume 3524 of Lecture Notes in Computer Science, Springer, 2005.

Automated Search for Heuristic FunctionsPavel Cejnar, Roman Barták. cp 2005: 843 [doi]

Desk-Mates (Stable Matching) with Privacy of Preferences, and a New Distributed CSP FrameworkMarius-Calin Silaghi, Amit Abhyankar, Markus Zanker, Roman Barták. flairs 2005: 671-677

Encoding HTN Planning as a Dynamic CSPPavel Surynek, Roman Barták. cp 2005: 868 [doi]

Extension of ::::O::::(::::n:::: log ::::n::::) Filtering Algorithms for the Unary Resource Constraint to Optional ActivitiesPetr Vilím, Roman Barták, Ondrej Cepek. constraints, 10(4):403-425, 2005. [doi]

Full Arc Consistency in WCSP and in Constraint Hierarchies with Finite DomainsJosef Zlomek, Roman Barták. cp 2005: 876 [doi]

2004

2003

Implementing Propagators for Tabular ConstraintsRoman Barták, Roman Mecl. csclp 2004: 44-65 [doi]

A New Approach to Modeling and Solving Minimal Perturbation ProblemsRoman Barták, Tomás Müller, Hana Rudová. csclp 2004: 233-249 [doi]

2002

Visopt ShopFloor: Going Beyond Traditional SchedulingRoman Barták. colognet 2003: 185-199 [doi]

Visopt ShopFloor: On the Edge of Planning and SchedulingRoman Barták. cp 2002: 587-602 [doi]

Modelling Resource Transitions in Constraint-Based SchedulingRoman Barták. sofsem 2002: 186-194 [doi]

A Theoretical Framework for Constraint Hierarchy SolversRoman Barták. ecai 2002: 146-150

Filtering Algorithms for Batch Processing with Sequence Dependent Setup TimesPetr Vilím, Roman Barták. aips 2002: 312-321

2000

Conceptual Models for Combined Planning and SchedulingRoman Barták. endm, 4:1, 2000. [doi]

1999

Dynamic Constraint Models for Planning and Scheduling ProblemsRoman Barták. compulog 2000: 237-255 [doi]