Filters








187 Hits in 4.1 sec

Slicing of Constraint Logic Programs [article]

Gyongyi Szilagyi, Tibor Gyimothy, Jan Maluszynski
2000 arXiv   pre-print
Data flow in constraint programs is not explicit, and for this reason the concepts of slice and the slicing techniques of imperative languages are not directly applicable.  ...  Slicing is a program analysis technique originally developed for imperative languages. It facilitates understanding of data flow and debugging.  ...  This would provide a focus for debugging, whatever is the debugging technique used. Intersection of the slices produced for different runs of the buggy program may further narrow the focus.  ... 
arXiv:cs/0012014v1 fatcat:u4veb33eyzcntljz2o3zmo4aki

Debugging of Constraint Programs: The DiSCiPl Methodology and Tools [chapter]

Pierre Deransart, Manuel V. Hermenegildo, Jan Małuszynski
2000 Lecture Notes in Computer Science  
It should be noticed that the use of assertions is not restricted to static analysis and correctness proofs.  ...  It may be used both for performance debugging and for correctness debugging as a support tool for the declarative diagnoser.  ... 
doi:10.1007/10722311_1 fatcat:zcbjpcnscrh53fp6akdxweqrte

Book reports

1992 Computers and Mathematics with Applications  
Intelligent backtracking for CLP languages: An application to CLP(R). 26. Some global compile-time optimizations for CLP(R). 27. Abstract interpretation of constraints on order-sorted domalnn.  ...  Using dylaamic predicate in an or-parallel prolog system. 23. A declarative alternative to "assert" in logic programming. 24. Semantics of logic programs with aggregates. XII. Constraints, I. 25.  ... 
doi:10.1016/0898-1221(92)90096-z fatcat:4pjyhq2h5zcxzcjs7pzcgpop54

Declarative Diagnosis of Missing Answers in Constraint Functional-Logic Programming [chapter]

Rafael Caballero, Mario Rodríguez Artalejo, Rafael del Vado Vírseda
2008 Lecture Notes in Computer Science  
We present a declarative method for diagnosing missing computed answers in CF LP (D), a generic scheme for lazy Constraint Functional-Logic Programming which can be instantiated by any constraint domain  ...  Our approach combines and extends previous work done separately for constraint logic programming and lazy functional programming languages.  ...  Acknowledgments The authors are grateful to the referees of previous versions of this paper for their constructive comments and suggestions.  ... 
doi:10.1007/978-3-540-78969-7_22 fatcat:qvcrpuj2krfdlfwxrdz77caxx4

Combined Static and Dynamic Assertion-Based Debugging of Constraint Logic Programs [chapter]

Germán Puebla, Francisco Bueno, Manuel Hermenegildo
2000 Lecture Notes in Computer Science  
We propose a general framework for assertion-based debugging of constraint logic programs. Assertions are linguistic constructions for expressing properties of programs.  ...  We define several assertion schemas for writing (partial) specifications for constraint logic programs using quite general properties, including user-defined programs.  ...  Introduction As (constraint) logic programming (CLP) systems [23] mature and larger applications are built, an increased need arises for advanced development and debugging environments.  ... 
doi:10.1007/10720327_16 fatcat:53f5lsd56bgdzm3jdiro6wjxru

Type Analysis for CHIP [chapter]

Włodzimierz Drabent, Paweł Pietrzak
1998 Lecture Notes in Computer Science  
By using \magic transformations" we can describe the call-success semantics of a program by the declarative semantics of another program. We are focused on CLP over nite domains.  ...  Our prototype program analyzer works for the programming language CHIP.  ...  ACKNOWLEDGMENT The authors want to thank Jan Ma luszy nski for discussions and suggestions.  ... 
doi:10.1007/3-540-49253-4_28 fatcat:f7e7fdbe4nbodgxal2yn3swe2q

A Semantic Framework for the Declarative Debugging of Wrong and Missing Answers in Declarative Constraint Programming [chapter]

Rafael del Vado Vrseda, Fernando Prez
2012 Semantics - Advances in Theories and Mathematical Models  
Following the CLP tradition, we have shown that our computation trees for missing answers are abbreviated proof trees in a suitable inference system, the so-called Constraint Negative Proof Calculus.  ...  Indeed in complicated programs involving constraints the acas can be large and intricate, as it is also the case with other debugging tools for CLP languages.  ...  A Semantic Framework for the Declarative Debugging of Wrong and Missing Answers in Declarative Constraint Programming 23 terminology of Definition 4) and type the command /missing at the system prompt  ... 
doi:10.5772/37119 fatcat:wo2u3ctotva77avgnr6c4motpe

Page 2548 of Mathematical Reviews Vol. , Issue 98D [page]

1998 Mathematical Reviews  
Older, Solving linear, min and max constraint systems using CLP based on re- lational interval arithmetic (186-203); Micha Meier, Debugging constraint programs (204-221); Andrew D.  ...  Yap, An optimizing compiler for CLP(#) (222-239); Rina Dechter and Peter van Beek, Local and global relational consistency (240-257); Fahiem Bacchus and Paul van Run, Dynamic variable ordering in CSPs  ... 

Theoretical Foundations of Value Withdrawal Explanations for Domain Reduction

G. Ferrand, W. Lesaint, A. Tessier
2002 Electronical Notes in Theoretical Computer Science  
Solvers on finite domains use local consistency notions to remove values from the domains. This paper defines value withdrawal explanations.  ...  The linking of these rules inductively defines proof trees. Such a proof tree clearly explains the removal of a value (which is the root of the tree).  ...  In [22] a framework for declarative debugging was described for the CLP scheme [16] . Symptom and error are connected via some kind of proof tree using clauses of the program.  ... 
doi:10.1016/s1571-0661(04)80788-6 fatcat:l2syxb22x5giporcsnatkx3fki

Page 6357 of Mathematical Reviews Vol. , Issue 97J [page]

1997 Mathematical Reviews  
Summary: “We develop a denotational, fully abstract semantics for constraint logic programming (clp) with respect to successful and failed observables.  ...  The former allows us to generalize the clp language by introducing an explicit hiding operator; the latter allows us to define a notion of negation which extends the clas- sical negation used in logic  ... 

ProB: A Model Checker for B [chapter]

Michael Leuschel, Michael Butler
2003 Lecture Notes in Computer Science  
ProB contains a model checker and a constraint-based checker, both of which can be used to detect various errors in B specifications.  ...  We present our first experiences in using ProB on several case studies, highlighting that ProB enables users to uncover errors that are not easily discovered by existing tools.  ...  Acknowledgements We would like to thank Laksono Adhianto, Stefan Gruner, Leonid Mikhailov, and especially Carla Ferreira for their help in implementing and testing ProB.  ... 
doi:10.1007/978-3-540-45236-2_46 fatcat:e7ubpcxq5zewzhhpvtv44r6dtu

A Framework for Assertion-based Debugging in Constraint Logic Programming [chapter]

Germàn Puebla, Francisco Bueno, Manuel Hermenegildo
1998 Lecture Notes in Computer Science  
We propose a general framework for assertion-based debugging of constraint logic programs. Assertions are linguistic constructions which allow expressing properties of programs.  ...  We define assertion schemas which allow writing (partial) specifications for constraint logic programs using quite general properties, including user-defined programs.  ...  Introduction As (constraint) logic programming (CLP) systems [19] mature and larger applications are built, an increased need arises for advanced development and debugging environments.  ... 
doi:10.1007/3-540-49481-2_43 fatcat:mou2rkuy6jhntnt6f2nnqnu3ue

Towards a Generic Framework to Generate Explanatory Traces of Constraint Solving and Rule-Based Reasoning [article]

Pierre Deransart
2010 arXiv   pre-print
This approach is used to define a method for extending a java based CHRor platform called CHROME (Constraint Handling Rule Online Model-driven Engine) with an extensible generic tracer.  ...  The method includes a tracer specification in SFC, a methodology to extend it, and the way to integrate it with CHROME, resulting in the platform CHROME-REF (for Reasoning Explanation Facilities), which  ...  Tracing Rule-Based Constraint Programming Constraint Handling Rules emerges in the context of Constraint Logic Programming (CLP) as a language for describing Constraint Solvers.  ... 
arXiv:1001.2188v1 fatcat:s7u3mfkp45handpokbzlnem7hm

Strategic directions in constraint programming

Pascal Van Hentenryck, Vijay Saraswat
1996 ACM Computing Surveys  
Particular thanks to Vineet Gupta for invaluable last-minute assistance.  ...  Two classes of algorithms in common use for user interface (UI) applications are one-way constraint algorithms and multi-way local propagation algorithms.  ...  Currently, at least one European project is working on the development of both assertionbased and visualization-based debugging techniques for CLP systems.  ... 
doi:10.1145/242223.242279 fatcat:3aqe7rubijeddoahomxho2vtou

SWRL-IQ: A Prolog-based Query Tool for OWL and SWRL

Daniel Elenius
2012 W3C Web Ontology Language (OWL) Experiences and Directions Workshop (OWLED)  
and queries, powerful SWRL extensions, and tracing and debugging features for explanation of reasoning results.  ...  3 There is also support for anonymous variables, i.e. variables whose bindings are not shown in the result.  ...  Acknowledgments The work described in this paper was carried out at the SRI International facilities in Menlo Park, California, and was funded in part by the U.S.  ... 
dblp:conf/owled/Elenius12 fatcat:wthlnavfvja7lotboumrpwvxly
« Previous Showing results 1 — 15 out of 187 results