The 31st edition of the internationalconference of logicprogramming (iclp2015) took place in Cork, Ireland, from 31 August2015 to 4 September 2015, co-located with the 21stinternationalconference on Principles a...
The 31st edition of the internationalconference of logicprogramming (iclp2015) took place in Cork, Ireland, from 31 August2015 to 4 September 2015, co-located with the 21stinternationalconference on Principles and Practice of Constraint programming (CP 2015) and part of George Boole 200, a celebration of the life and work of George Boole who was born in 1815 and worked at the University College of Cork.
The special issue of Theory and Practice of logicprogramming (TPLP) consists of the regular papers accepted for presentation at internationalconference of logicprogramming (iclp) 2015. Altogether 89 submissions of ...
详细信息
The special issue of Theory and Practice of logicprogramming (TPLP) consists of the regular papers accepted for presentation at internationalconference of logicprogramming (iclp) 2015. Altogether 89 submissions of abstracts were received of which 74 resulted in submissions of papers. The program chairs, acting as guest editors of this special issue, organized the refereeing process with the help of the program committee and external reviewers. Each paper was reviewed by at least three anonymous referees who provided full written evaluations. The paper Complexity and Compilation of GZ-Aggregates in Answer Set programming, by Mario Alviano and Nicola Leone, was awarded the iclp 2015 Best Paper Prize. In addition to the presentations of accepted papers, the technical program of iclp 2015 included two panels, on The Future Publication of iclp Proceedings, chaired by Torsten Schaub, and Teaching Computer Science and Declarative programming in Schools and Universities, chaired by Manuel Hermenegildo.
The fourth internationalconference on logicprogramming and Nonmonotonic Reasoning (LPNMR) was held in Dagstuhl, Germany from the 28th to the 31st of July 1997. This year's installment of LPNMR reflected a new st...
详细信息
The fourth internationalconference on logicprogramming and Nonmonotonic Reasoning (LPNMR) was held in Dagstuhl, Germany from the 28th to the 31st of July 1997. This year's installment of LPNMR reflected a new stage in the development of this cross-disciplinary field, with demonstrations of ten implemented system joining the submitted papers, invited talks and panel discussions. The details of the conference together with the various topics tackled are presented.
The proceedings contain 11 papers. The topics discussed include: towards deriving conclusions from cause-effect relations;logicprogramming with graded introspection;answer set programming modulo acyclicity;shift desi...
The proceedings contain 11 papers. The topics discussed include: towards deriving conclusions from cause-effect relations;logicprogramming with graded introspection;answer set programming modulo acyclicity;shift design with answer set programming;constraint answer set programming based on HEX-programs;reduct-based stability check using literal assumptions;finite proofs for infinitary formulas;solving qualitative spatio-temporal reasoning problems by means of answer set programming: methods and experiments;and embedding ASP in mobile systems: discussion and preliminary implementation.
The proceedings contain 87 papers. The special focus in this conference is on Declarative programming. The topics include: Concolic testing of functional logic programs;Declarative XML Schema validation with SWI–Prol...
ISBN:
(纸本)9783030008000
The proceedings contain 87 papers. The special focus in this conference is on Declarative programming. The topics include: Concolic testing of functional logic programs;Declarative XML Schema validation with SWI–Prolog: System description;plspec – A specification language for prolog data;run-time analysis of temporal constrained objects;implementation of logical retraction in constraint handling rules with justifications;the proportional constraint and its pruning;an operational semantics for constraint-logic imperative programming;hypertree decomposition: The firststep towards parallel constraint solving;declarative aspects in explicative data mining for computational sensemaking;an approach for representing answer sets in natural language;Techniques for efficient lazy-grounding ASP solving.
The proceedings contain 11 papers. The special focus in this conference is on Inductive logicprogramming. The topics include: A Program-Synthesis Challenge for ARC-Like Tasks;explaining with Attribute-Based...
ISBN:
(纸本)9783031556296
The proceedings contain 11 papers. The special focus in this conference is on Inductive logicprogramming. The topics include: A Program-Synthesis Challenge for ARC-Like Tasks;explaining with Attribute-Based and Relational Near Misses: An Interpretable Approach to Distinguishing Facial Expressions of Pain and Disgust;learning Automata-Based Complex Event Patterns in Answer Set programming;learning Hierarchical Problem Networks for Knowledge-Based Planning;combining Word Embeddings-Based Similarity Measures for Transfer Learning Across Relational Domains;learning Assumption-Based Argumentation Frameworks;Diagnosis of Event Sequences with LFIT;efficient Abductive Learning of Microbial Interactions Using Meta Inverse Entailment;functional Lifted Bayesian Networks: statistical Relational Learning and Reasoning with Relative Frequencies.
The issue of fairness is a well-known challenge in Machine Learning (ML) that has gained increased importance with the emergence of Large Language Models (LLMs) and generative AI. Algorithmic bias can manifest during ...
详细信息
Software testing is one of the most popular validation techniques in the software industry. Surprisingly, we can only find a few approaches to testing in the context of logicprogramming. In this paper, we introduce a...
详细信息
Software testing is one of the most popular validation techniques in the software industry. Surprisingly, we can only find a few approaches to testing in the context of logicprogramming. In this paper, we introduce a systematic approach for dynamic testing that combines both concrete and symbolic execution. Our approach is fully automatic and guarantees full path coverage when it terminates. We prove some basic properties of our technique and illustrate its practical usefulness through a prototype implementation.
Tabling is probably the most widely studied extension of Prolog. But despite its importance and practicality, tabling is not implemented by most Prolog systems. Existing approaches require substantial changes to the P...
详细信息
Tabling is probably the most widely studied extension of Prolog. But despite its importance and practicality, tabling is not implemented by most Prolog systems. Existing approaches require substantial changes to the Prolog engine, which is an investment out of reach of most systems. To enable more widespread adoption, we present a new implementation of tabling in under 600 lines of Prolog code. Our lightweight approach relies on delimited control and provides reasonable performance.
暂无评论