Stable models of logic programs have been studied and characterized also in comparison with other formalisms by many researchers. As already argued, such characterizations are interesting for many reasons, including the possibility of leading to new algorithms for computing stable models. In this paper we provide a simple characterization of...
-
2023 (v1)PublicationUploaded on: July 3, 2024
-
2024 (v1)Publication
In this paper, we propose a novel approach for solving linear numeric planning problems, called Symbolic Pattern Planning. Given a planning problem Π, a bound n and a pattern –defined as an arbitrary sequence of actions– we encode the problem of finding a plan for Π with bound n as a formula with fewer variables and/or clauses than the...
Uploaded on: July 3, 2024