default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDProgram Development in Computational Logic 2004
- Maurice Bruynooghe, Kung-Kiu Lau:
Program Development in Computational Logic: A Decade of Research Advances in Logic-Based Program Development. Lecture Notes in Computer Science 3049, Springer 2004, ISBN 3-540-22152-2
Specification and Synthesis
- Kung-Kiu Lau, Mario Ornaghi:
Specifying Compositional Units for Correct Program Development in Computational Logic. 1-29 - David A. Basin, Yves Deville
, Pierre Flener, Andreas Hamfelt, Jørgen Fischer Nilsson:
Synthesis of Programs in Computational Logic. 30-65 - Robert Colvin, Lindsay Groves, Ian J. Hayes, David Hemer, Ray Nickson, Paul A. Strooper:
Developing Logic Programs from Specifications Using Stepwise Refinement. 66-89
Semantics
- Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sabina Rossi:
Declarative Semantics of Input Consuming Logic Programs. 90-114 - Antonio Brogi:
On the Semantics of Logic Program Composition. 115-151
Analysis
- Jacob M. Howe, Andy King, Lunjin Lu:
Analysing Logic Programs by Reasoning Backwards. 152-188 - Wim Vanhoof, Maurice Bruynooghe, Michael Leuschel:
Binding-Time Analysis for Mercury. 189-232 - Germán Puebla, Jesús Correas, Manuel V. Hermenegildo, Francisco Bueno, Maria J. García de la Banda, Kim Marriott, Peter J. Stuckey:
A Generic Framework for Context-Sensitive Analysis of Modular Programs. 233-260
Transformation and Specialisation
- Abhik Roychoudhury, C. R. Ramakrishnan:
Unfold/Fold Transformations for Automated Verification of Parameterized Concurrent Systems. 261-290 - Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti:
Transformation Rules for Locally Stratified Constraint Logic Programs. 291-339 - Michael Leuschel, Stephen-John Craig, Maurice Bruynooghe, Wim Vanhoof:
Specialising Interpreters Using Offline Partial Deduction. 340-375
Termination
- Dino Pedreschi, Salvatore Ruggieri, Jan-Georg Smaus:
Characterisations of Termination in Logic Programming. 376-431 - Jonathan C. Martin, Andy King:
On the Inference of Natural Level Mappings. 432-452 - Naomi Lindenstrauss, Yehoshua Sagiv, Alexander Serebrenik:
Proving Termination for Logic Programs by the Query-Mapping Pairs Approach. 453-498
Systems
- Bart Demoen, Maria J. García de la Banda, Warwick Harvey, Kim Marriott, David Overton, Peter J. Stuckey:
Herbrand Constraints in HAL. 499-538
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-04-22 23:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
