From abed038abffff7146f1c2d14332638dafdade92d Mon Sep 17 00:00:00 2001 From: Philipp Wanko Date: Fri, 10 Nov 2023 19:45:12 +0100 Subject: [PATCH] Update README.md --- README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/README.md b/README.md index 513cacb..cfce5ba 100644 --- a/README.md +++ b/README.md @@ -19,7 +19,7 @@ fclingo is an extension of [clingo](https://github.com/potassco/clingo) and acce fclingo relies on the constraint answer set programming (CASP) solver [clingcon](https://github.com/potassco/clingo) into whose language a fclingo program is translated. fclingo's two main advantages are foundedness of the integer variables and aggregates over integer variables. The former allows variables to be undefined and only assume a value if a reason for that value can be derived. This differs to the behavior of CASP, where variables are always defined and in absence of any constraint to a variable, all possible values are enumerated. The latter generalizes ASP aggregates to contain integer variables that are not subject to grounding. ### Output -The answer sets of fclingo programs contain symbols `val(x,v)`, where `x` is an integer variable occurring in the program and `v` is the integer value of the variable in the answer set. The absence of such an atom means the variable is undefined. +The answer sets of fclingo programs contain terms `val(x,v)`, where `x` is an integer variable occurring in the program and `v` is the integer value of the variable in the answer set. The absence of such a term means the variable is undefined. ### Language overview fclingo atoms have the following form: