|
Descripción
|
|
|---|---|
| Extending Datalog/ASP with constraints (CASP) enhances its expressiveness and performance but it is not straightforward as the grounding phase removes variables and the links among them. We incorporate constraints into s(ASP), a goal-directed, top-down execution model which implements predicate answer set programming without grounding. The resulting model, s(CASP), can constrain variables that, as in CLP, are kept during the execution and in the answer sets. We show the enhanced expressiveness of s(CASP) w.r.t. other CASP systems, through a non-trivial example of modeling the event calculus. | |
|
Internacional
|
Si |
|
Nombre congreso
|
3rd Int¿l. Workshop on the Resurgence of Datalog in Academia and Industry (Datalog 2.0) |
|
Tipo de participación
|
960 |
|
Lugar del congreso
|
Philadelphia (USA) |
|
Revisores
|
Si |
|
ISBN o ISSN
|
1613-0073 |
|
DOI
|
|
|
Fecha inicio congreso
|
04/06/2019 |
|
Fecha fin congreso
|
05/06/2019 |
|
Desde la página
|
22 |
|
Hasta la página
|
26 |
|
Título de las actas
|
Proceedings of the 3rd Int?l. Workshop on the Resurgence of Datalog in Academia and Industry (Datalog 2.0) |