Search Results for author:
Found 3 papers, 1 papers with code
Past-present temporal programs over finite traces
Extensions of Answer Set Programming with language constructs from temporal logics, such as temporal equilibrium logic over finite traces (TELf), provide an expressive computational framework for modeling dynamic applications.
Planning with Incomplete Information in Quantified Answer Set Programming
We present a general approach to planning with incomplete information in Answer Set Programming (ASP).
Implementing Dynamic Answer Set Programming
We introduce an implementation of an extension of Answer Set Programming (ASP) with language constructs from dynamic (and temporal) logic that provides an expressive computational framework for modeling dynamic applications.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
