User:Franc - Revision history

Jpye at 00:12, 20 January 2011

2011-01-20T00:12:49Z

← Older revision		Revision as of 00:12, 20 January 2011
Line 167:		Line 167:

	Initially let's worry about boolean WHEN statements only, so we need to check the discrete variable type, see the {{src\|ascend/system/discrete.h}} header for the appropriate structures and ways to handle that.		Initially let's worry about boolean WHEN statements only, so we need to check the discrete variable type, see the {{src\|ascend/system/discrete.h}} header for the appropriate structures and ways to handle that.

			== Numbering issues ==

			When creating the boolean expression, we need unique numbers for all the boolean variables in our SAT expression.

			For dvars, we can use dis_sindex(dv) to return a suitable number.

			For relations (from [[USE]]) we can use rel_sindex(rel) (from {{src\|ascend/system/rel.h}}) to return a suitable number.

			Both of these are (I believe) starting at zero, so to compile a master list, we should add ndvars to the rel_sindex, maybe plus 1?

Jpye: /* Running the test suite */

2011-01-19T23:57:12Z

Running the test suite

← Older revision		Revision as of 23:57, 19 January 2011
Line 163:		Line 163:
	ldd test/test # should show ~/ascend/libascend.so.1 being successfully found, make sure not linking to /usr/lib		ldd test/test # should show ~/ascend/libascend.so.1 being successfully found, make sure not linking to /usr/lib
	export ASCENDLIBRARY=~/ascend/models:~/ascend/solvers/absolver		export ASCENDLIBRARY=~/ascend/models:~/ascend/solvers/absolver

			== Discrete variables ==

			Initially let's worry about boolean WHEN statements only, so we need to check the discrete variable type, see the {{src\|ascend/system/discrete.h}} header for the appropriate structures and ways to handle that.

Jpye at 01:21, 17 January 2011

2011-01-17T01:21:44Z

← Older revision		Revision as of 01:21, 17 January 2011
Line 1:		Line 1:
	'''Franc Ivankovic''' is (Dec-Jan 2010) working on adding support for the [[ABsolver]] solver to ASCEND.		'''Franc Ivankovic''' is (Dec-Jan 2010) working on adding support for the [[ABsolver]] solver to ASCEND.

	* {{~~srcbranch~~\|absolver\|solvers/absolver}}		* {{srcbranchdir\|absolver\|solvers/absolver}}
	* {{srcbranch\|absolver\|ascend/compiler/logrel_cnf.c}}		* {{srcbranch\|absolver\|ascend/compiler/logrel_cnf.c}}
	* {{srcbranch\|absolver\|ascend/compiler/logrel_cnf.h}}		* {{srcbranch\|absolver\|ascend/compiler/logrel_cnf.h}}

Jpye at 01:29, 12 January 2011

2011-01-12T01:29:18Z

← Older revision		Revision as of 01:29, 12 January 2011
Line 157:		Line 157:
	relation structures using the WHEN/CASE lists. I'll try to do something		relation structures using the WHEN/CASE lists. I'll try to do something
	towards that this evening.		towards that this evening.

			== Running the test suite ==

			export LD_LIBRARY_PATH=~/ascend:/usr/local/lib
			ldd test/test # should show ~/ascend/libascend.so.1 being successfully found, make sure not linking to /usr/lib
			export ASCENDLIBRARY=~/ascend/models:~/ascend/solvers/absolver

Jpye: /* Notes from John about parse WHEN lists */

2011-01-11T08:00:07Z

Notes from John about parse WHEN lists

← Older revision		Revision as of 08:00, 11 January 2011
Line 45:		Line 45:
	need to use the routines in {{src\|ascend/general/list.h}} like gl_fetch and gl_length, for example, in looping. Note that gl_lists		need to use the routines in {{src\|ascend/general/list.h}} like gl_fetch and gl_length, for example, in looping. Note that gl_lists
	start at 1 and not 0 like most C arrays. Stoopid.		start at 1 and not 0 like most C arrays. Stoopid.

			The when_dvars_list is a list containing <tt>dis_discrete</tt> objects, see {{src\|ascend/system/discrete.h}} for details.

	Also see		Also see

Jpye at 07:46, 11 January 2011

2011-01-11T07:46:16Z

← Older revision		Revision as of 07:46, 11 January 2011
Line 12:		Line 12:
	# make output from the above solver which can be sent as a text file for processing by ABSolver		# make output from the above solver which can be sent as a text file for processing by ABSolver
	# parse the output of ABSolver in response to the above input file, and poke the resulting solution values back into ASCEND for review by the user.		# parse the output of ABSolver in response to the above input file, and poke the resulting solution values back into ASCEND for review by the user.
			# test the resulting code with sample models from Andreas Bauer, translated into ASCEND. If time permits, test the new solver with models from [[Vicente Rico-Ramirez]] ([[CMSlv]]) as well.

	== Notes from John about parse WHEN lists ==		== Notes from John about parse WHEN lists ==

Jpye at 07:45, 11 January 2011

2011-01-11T07:45:02Z

← Older revision		Revision as of 07:45, 11 January 2011
Line 4:		Line 4:
	* {{srcbranch\|absolver\|ascend/compiler/logrel_cnf.c}}		* {{srcbranch\|absolver\|ascend/compiler/logrel_cnf.c}}
	* {{srcbranch\|absolver\|ascend/compiler/logrel_cnf.h}}		* {{srcbranch\|absolver\|ascend/compiler/logrel_cnf.h}}

			'''Goals'''

			# write C code to convert arbitrary logical relations to CNF form.
			# make the above code such that it re-uses {{src\|ascend/compiler/logical_relation.h}} data structures.
			# write a simple ASCEND solver the reads WHEN lists and creates logical relation data structures to represent the [[conditional modelling]] problem encoded therein.
			# make output from the above solver which can be sent as a text file for processing by ABSolver
			# parse the output of ABSolver in response to the above input file, and poke the resulting solution values back into ASCEND for review by the user.

	== Notes from John about parse WHEN lists ==		== Notes from John about parse WHEN lists ==

Jpye: /* Notes from John about parse WHEN lists */

2011-01-11T07:42:07Z

Notes from John about parse WHEN lists

← Older revision		Revision as of 07:42, 11 January 2011
Line 21:		Line 21:
	We have a different need, which is to export the whole model to another		We have a different need, which is to export the whole model to another
	solver.		solver.

	~~<source lang=sh>~~
	~~cd ~/ascend/ascend~~
	~~cscope -qR~~
	~~</source>~~

	In {{src\|ascend/system/slv_client.h}}, see <tt>slv_get_solvers_when_list(...)</tt> - returns a NULL-terminated list.		In {{src\|ascend/system/slv_client.h}}, see <tt>slv_get_solvers_when_list(...)</tt> - returns a NULL-terminated list.

Jpye: /* Notes from John about parse WHEN lists */

2011-01-11T07:41:45Z

Notes from John about parse WHEN lists

← Older revision		Revision as of 07:41, 11 January 2011
Line 7:		Line 7:
	== Notes from John about parse WHEN lists ==		== Notes from John about parse WHEN lists ==

	The 'relation_term' data structures:		The 'relation_term' data structures: {{src\|ascend/compiler/relation_type.h}}

	ascend/compiler/~~relation_type~~.h		Sample code that manipulates same: {{src\|ascend/compiler/exprsym.h}}

	~~Sample code that manipulates same:~~		'''How to get access to the list of whens'''

	~~ascend/compiler/exprsym.h~~

	How to get access to the list of whens~~...~~

	Note we looked at CMSlv and we found that instead of accessing the list		Note we looked at CMSlv and we found that instead of accessing the list
Line 26:		Line 22:
	solver.		solver.

	cd ~/ascend/ascend		<source lang=sh>
	cscope -qR		cd ~/ascend/ascend
			cscope -qR
			</source>

	ascend/system/slv_client.h		In {{src\|ascend/system/slv_client.h}}, see <tt>slv_get_solvers_when_list(...)</tt> - returns a NULL-terminated list.

	slv_get_solvers_when_list(...)

	~~Returns~~ a NULL-terminated list.

	~~ascend/system/conditional.h~~

			In {{src\|ascend/system/conditional.h}},
			<source lang=c>
	extern struct gl_list_t when_dvars_list( struct w_when when);		extern struct gl_list_t when_dvars_list( struct w_when when);
	/*< Retrieves the list of dis variables of the given when. /		/*< Retrieves the list of dis variables of the given when. /
Line 42:		Line 36:
	extern struct gl_list_t when_cases_list( struct w_when when);		extern struct gl_list_t when_cases_list( struct w_when when);
	/*< Retrieves the list of cases of the given when. /		/*< Retrieves the list of cases of the given when. /
			</source>

	Note that the above functions return 'gl_list_t' objects, for which you		Note that the above functions return 'gl_list_t' objects, for which you
	need to use the routines in		need to use the routines in {{src\|ascend/general/list.h}} like gl_fetch and gl_length, for example, in looping. Note that gl_lists

	ascend/general/list.h

	like gl_fetch and gl_length, for example, in looping. Note that gl_lists
	start at 1 and not 0 like most C arrays. Stoopid.		start at 1 and not 0 like most C arrays. Stoopid.

			Also see
			<source lang=c>
	extern int32 when_case_values_list( struct when_case wc);		extern int32 when_case_values_list( struct when_case wc);
	/*< Retrieves the list of values of the given case. /		/*< Retrieves the list of values of the given case. /
			</source>

	will tell us the values of the dvars in the present 'when_case'.		which will tell us the values of the dvars in the present 'when_case'.

			<source lang=c>
	extern struct gl_list_t when_case_rels_list( struct when_case wc);		extern struct gl_list_t when_case_rels_list( struct when_case wc);
	/*< Retrieves the list of rels of the given case. /		/*< Retrieves the list of rels of the given case. /
			</source>

	will tell us the relations that are switched on by this case.		will tell us the relations that are switched on by this case.

	but ~~not~~ that WHENs can also be used to switch on...		but note that WHENs can also be used to switch on...

	~~...~~logical relations~~...~~		'''logical relations'''

			<source lang=c>
	extern struct gl_list_t when_case_logrels_list( struct when_case wc);		extern struct gl_list_t when_case_logrels_list( struct when_case wc);
	/*< Retrieves the list of logrels of the given case. /		/*< Retrieves the list of logrels of the given case. /
			</source>

	~~...and~~ nested WHENs~~...~~		'''nested WHENs'''

			<source lang=c>
	extern struct gl_list_t when_case_whens_list( struct when_case wc);		extern struct gl_list_t when_case_whens_list( struct when_case wc);
	/*< Retrieves the list of whens nested in the given case. /		/*< Retrieves the list of whens nested in the given case. /
			</source>

	That looks like all you need to know... I hope. You might have to		That looks like all you need to know... I hope. You might have to
Line 83:		Line 81:
	tucked away in some of the other solvers.		tucked away in some of the other solvers.

	var_make_name ~~or something like..~~.		Note <tt>var_make_name</tt> can be used to create names of variables, if you have the pointer to the var_variable that you need.

	Names can include dots, etc		Names can include dots, etc., e.g.:

	mymodel.submodel.var1		mymodel.submodel.var1
Line 93:		Line 91:
	need.		need.

	static Term MakeAdd(Term left, Term *right)		<source lang=c>
			static Term MakeAdd(Term left, Term *right)
			</source>

	for example does the job of creating a "plus" node that is linked to		for example does the job of creating a "plus" node that is linked to
Line 103:		Line 103:
	logical relations, and then run your routine on those relations directly.		logical relations, and then run your routine on those relations directly.

	static void test_instantiate_file(void){		<source lang=c>
			static void test_instantiate_file(void){
			</source>

	from ascend/compiler/test/test_basics.c shows you how to write a show		from ascend/compiler/test/test_basics.c shows you how to write a show

Jpye at 07:36, 11 January 2011

2011-01-11T07:36:32Z

← Older revision		Revision as of 07:36, 11 January 2011
Line 108:		Line 108:
	C-language test routine that will load your file and then allow you to		C-language test routine that will load your file and then allow you to
	access the data structures.		access the data structures.

			== Notes from John about CUnit tests ==

			I have committed some test code that
			you can use to access relation structures for use in testing your
			converted-to-ASCEND C code.

			To use this code, you first need to install CUnit. Although CUnit is
			available from Ubuntu repsitories, that package is outdated and contains
			a bug. Hence, you should install CUnit from its svn repository; there
			are some quick instructions for that here:

			http://ascendwiki.cheme.cmu.edu/Developer%27s_Manual#CUnit_test_suites

			The test that I wrote to help you is here:

			test/test compiler_expr.boolrel

			The code for that test is in ascend/compiler/test/test_expr.c, around
			line 100. You can modify that file to make calls to your CNF code, which
			I suggest you add as a file logrel_cnf.c in ascend/compiler directory.
			That file should be added to the filename list in
			ascend/compiler/SConscript in order for it to be compiled as part of
			libascend.

			I will add you as a user to our Subversion repository, and create a
			branch for you, so that you can safely store your code in ASCEND's server.

			IMPORTANT: while building the above test, I noticed the the relation
			structure data types are indeed different for logical relations, as
			compared to real-valued relations. The file in which the data structures
			are defined is in ascend/compiler/logical_relation.h. The code in the
			various files ascend/compiler/log*.h will help you with different
			routines that you can use with those data structures. The structures are
			very similar to the relation.h structures, but a bit simpler because of
			their narrower scope.

			The next thing I will do to help you will be to build a skeleton solver
			into which you will be able to place some looping code to create your
			relation structures using the WHEN/CASE lists. I'll try to do something
			towards that this evening.