Search Results for author:
Found 2 papers, 0 papers with code
Temporal Answer Set Programming
We present an overview on Temporal Logic Programming under the perspective of its application for Knowledge Representation and declarative problem solving.
Revisiting Explicit Negation in Answer Set Programming
A common feature in Answer Set Programming is the use of a second negation, stronger than default negation and sometimes called explicit, strong or classical negation.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
