Logic Programming
URI permanente para esta colección:
Artículos en la categoría Logic Programming publicados en las Actas de las XIX Jornadas de Programación y Lenguajes (PROLE 2019).
Notificar un error en esta colección
Examinar
Envíos recientes
Artículo Modeling and Reasoning in Event Calculus Using Constraint Answer Set ProgrammingArias, Joaquín; Carro, Manuel. Actas de las XIX Jornadas de Programación y Lenguajes (PROLE 2019), 2019-09-02.Automated commonsense reasoning is essential for building human-like AI systems featuring, for example, explainable AI. Event Calculus (EC) is a family of formalisms that model commonsense reasoning with a sound, logical basis. Previous attempts to mechanize reasoning using EC faced difficulties in the treatment of continuous change in dense domains (e.g., time and other physical quantities), constraints among variables, default negation, and the uniform application of different inference methods, among others. We propose the use of s(CASP), a query driven, top-down execution model for predicate Answer Set Programming with Constraints, to model and reason using EC. We show how EC scenarios can be modeled in s(CASP) and how its expressiveness makes it pos- sible to perform deductive and abductive reasoning tasks in domains featuring, for example, constraints involving dense time and fluents.Resumen Static Performance Guarantees for Programs with Run-time ChecksKlemen, Maximiliano; Stulova, Nataliia; Lopez-Garcia, Pedro; Hermenegildo, Manuel V.; Morales, Jose F.. Actas de las XIX Jornadas de Programación y Lenguajes (PROLE 2019), 2019-09-02.Instrumenting programs for performing runtime checking of properties, such as regular shapes, is a common and useful technique that helps programmers detect incorrect program behaviors. This is especially true in dynamic languages such as Prolog. However, such runtime checks inevitably introduce runtime overhead (in execution time, memory, energy, etc.). Several approaches have been proposed for reducing this overhead, such as eliminating the checks that can statically be proved to always succeed, and/or optimizing the way in which the (remaining) checks are performed. However, there are cases in which it is not possible to remove all checks statically (e.g., open libraries which must check their interfaces, complex properties, unknown code, etc.) and in which, even after optimizations, these remaining checks may still introduce an unacceptable level of overhead. It is thus important for programmers to be able to determine the additional cost due to the runtime checks and compare it to some notion of admissible cost. The common practice used for estimating runtime checking overhead is profiling, which is not exhaustive by nature. Instead, we propose a method that uses static analysis to estimate such overhead, with the advantage that the estimations are functions parameterized by input data sizes. Unlike profiling, this approach can provide guarantees for all possible execution traces, and allows assessing how the overhead grows as the size of the input grows. Our method also extends an existing assertion verification framework to express "admissible" overheads, and statically and automatically checks whether the instrumented program conforms with such specifications. Finally, we present an experimental evaluation of our approach that suggests that our method is feasible and promising.Resumen Incremental Evaluation of Lattice-Based Aggregates in Logic Programming Using Modular TCLPArias, Joaquín; Carro, Manuel. Actas de las XIX Jornadas de Programación y Lenguajes (PROLE 2019), 2019-09-02.Practical Aspects of Declarative Languages - 21th International Symposium, PADL 2019, Lisbon, Portugal, January 14-15, 2019. doi 10.1007/978-3-030-05998-9_7