 |
Main /
SoftwareMain.Software HistoryShow minor edits - Show changes to markup December 10, 2011, at 11:29 PM
by -
Changed lines 3-5 from:
CLab (2004,2006)CLab is an open-source configuration tool for research and educational purposes. A configuration problem is stated as a conjunction of rules on a set of finite domain variables in a language called CP. CLab provides functions for finding valid configurations efficiently either by using Binary Decision Diagrams (BDDs) to compactly represent the solutiopn space or by applying constraint processing algorithms. CLab has been implemented in lex/yacc/C/C++ and XML/C#. to:
CLab (2004,2006,2011)CLab is an open-source configuration tool for research and educational purposes. A configuration problem is stated as a conjunction of rules on a set of finite domain variables in a language called CP. CLab provides functions for finding valid configurations efficiently either by using Binary Decision Diagrams (BDDs) to compactly represent the solutiopn space or by applying constraint processing algorithms. CLab has been implemented in C++ and uses Flex and Yacc for parsing. November 05, 2007, at 08:22 PM
by - November 05, 2007, at 07:52 PM
by -
Changed line 6 from:
Bifrost (2002)to:
Bifrost (2002)Changed line 9 from:
UMOP (1999)to:
UMOP (1999)November 05, 2007, at 07:51 PM
by -
Changed lines 4-5 from:
CLab is an open-source configuration tool for research and educational purposes. A configuration problem is stated as a conjunction of rules on a set of finite domain variables in a language called CP. CLab provides functions for finding valid configurations efficiently either by using Binary Decision Diagrams (BDDs) to compactly represent the solutiopn space or by applying efficient constraint processing algorithms. CLab has been implemented in lex/yacc/C/C++ and XML/C#. to:
CLab is an open-source configuration tool for research and educational purposes. A configuration problem is stated as a conjunction of rules on a set of finite domain variables in a language called CP. CLab provides functions for finding valid configurations efficiently either by using Binary Decision Diagrams (BDDs) to compactly represent the solutiopn space or by applying constraint processing algorithms. CLab has been implemented in lex/yacc/C/C++ and XML/C#. November 05, 2007, at 07:50 PM
by -
Changed lines 4-5 from:
CLab is an open-source configuration tool for research and educational purposes. A configuration problem is stated as a conjunction of rules on a set of finite domain variables in a language called CP. CLab provides functions for finding valid configurations efficiently either by using Binary Decision Diagrams (BDDs) to compactly represent the solutiopn space or by applying efficient constraint processing algorithms. CLab has been implemented in lex/yacc/C/C++/STL and XML/C#. to:
CLab is an open-source configuration tool for research and educational purposes. A configuration problem is stated as a conjunction of rules on a set of finite domain variables in a language called CP. CLab provides functions for finding valid configurations efficiently either by using Binary Decision Diagrams (BDDs) to compactly represent the solutiopn space or by applying efficient constraint processing algorithms. CLab has been implemented in lex/yacc/C/C++ and XML/C#. November 05, 2007, at 07:49 PM
by -
Changed lines 1-2 from:
http://www.itu.dk/~rmj/data/figures/Clab2.jpg to:
http://www.itu.dk/~rmj/data/figures/CLab2.jpg November 05, 2007, at 07:48 PM
by -
Added lines 1-2:
http://www.itu.dk/~rmj/data/figures/Clab2.jpg November 05, 2007, at 07:46 PM
by -
Added lines 1-8:
CLab (2004,2006)CLab is an open-source configuration tool for research and educational purposes. A configuration problem is stated as a conjunction of rules on a set of finite domain variables in a language called CP. CLab provides functions for finding valid configurations efficiently either by using Binary Decision Diagrams (BDDs) to compactly represent the solutiopn space or by applying efficient constraint processing algorithms. CLab has been implemented in lex/yacc/C/C++/STL and XML/C#. Bifrost (2002)BIFROST is an experimental planning system for research on heuristic symbolic planning, adversarial non-deterministic planning, and fault tolerant planning. BIFROST has a large number of benchmark problems including the SIDMAR steel plant, DS1 space craft, Channel routing, Power supply restoration, and the ICAPS planning competition problems. The input language to BIFROST is NADL+, an extension to NADL for fault tolerant planning and heuristic search. UMOP (1999)UMOP is a multi-agent planning system for synchronized agents in non-deterministic domains. It includes a partitioning technique for the NADL language and planning algorithms for generating strong, strong-cyclic, and weak plans. |