August 17, 2005
Similar papers 4
January 11, 2017
This volume contains a selection of the papers presented at the XVI Jornadas sobre Programaci\'on y Lenguajes (PROLE 2016), held at Salamanca, Spain, during September 14th-15th, 2016. Previous editions of the workshop were held in Santander (2015), C\'adiz (2014), Madrid (2013), Almer\'ia (2012), A Coru\~na (2011), Val\`encia (2010), San Sebasti\'an (2009), Gij\'on (2008), Zaragoza (2007), Sitges (2006), Granada (2005), M\'alaga (2004), Alicante (2003), El Escorial (2002), an...
July 27, 2015
This volume constitutes the proceedings of LFMTP 2015, the Tenth International Workshop on Logical Frameworks and Meta-Languages: Theory and Practice, held on August 1st, 2015 in Berlin, Germany. The workshop was a one-day satellite event of CADE-25, the 25th International Conference on Automated Deduction. Logical frameworks and meta-languages form a common substrate for representing, implementing, and reasoning about a wide variety of deductive systems of interest in logic ...
July 14, 2021
Logical frameworks and meta-languages form a common substrate for representing, implementing and reasoning about a wide variety of deductive systems of interest in logic and computer science. Their design, implementation and their use in reasoning tasks, ranging from the correctness of software to the properties of formal systems, have been the focus of considerable research over the last two decades. This workshop brings together designers, implementors and practitioners to ...
January 10, 2013
This volume contains the papers presented at the fifth workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2012) held on September 4th, 2012 in Budapest, co-located with the 28th International Conference on Logic Programming (ICLP 2012). It thus continues a series of previous events co-located with ICLP, aiming at facilitating the discussion about crossing the boundaries of current ASP techniques in theory, solving, and applications, in combination with o...
November 2, 2007
ECLAIR is a Prolog-based prototype system aiming to provide a functionally complete environment for the study, development and evaluation of programming language analysis and implementation tools. In this paper, we sketch the overall structure of the system, outlining the main methodologies and technologies underlying its components. We also discuss the appropriateness of Prolog as the implementation language for the system: besides highlighting its strengths, we also point o...
October 29, 2014
The UITP workshop series brings together researchers interested in designing, developing and evaluating user interfaces for automated reasoning tools, such as interactive proof assistants, automated theorem provers, model finders, tools for formal methods, and tools for visualising and manipulating logical formulas and proofs. The eleventh edition of UITP took place in Vienna, Austria, and was part of the Vienna Summer of Logic, the largest ever joint conference in the area o...
December 21, 2011
These are the revised versions of the papers presented at CICLOPS 2011, a workshop colocated with ICLP 2011.
March 30, 2010
This volume contains the proceedings of RULE 2009: the tenth International Workshop on Rule-Based Programming. It took place in June 28th 2009, Brasilia, Brazil, as a satellite event of RDP 2009. The first Rule workshop was held in Montreal in 2000, and subsequent editions took place in Firenze, Pittsburgh, Valencia, Aachen, Nara, Seattle, Paris, and Hagenberg.
November 16, 2023
Logical frameworks and meta-languages form a common substrate for representing, implementing and reasoning about a wide variety of deductive systems of interest in logic and computer science. Their design, implementation and their use in reasoning tasks, ranging from the correctness of software to the properties of formal systems, have been the focus of considerable research over the last two decades. This workshop brings together designers, implementors and practitioners to ...
April 26, 2023
Our position is that logic programming is not programming in the Horn clause sublogic of classical logic, but programming in a logic of (inductive) definitions. Thus, the similarity between prototypical Prolog programs (e.g., member, append, ...) and how inductive definitions are expressed in mathematical text, is not coincidental but essential. We argue here that this provides a natural solution to the main lingering semantic questions of Logic Programming and its extensions...