3,512 Hits in 6.9 sec

Page 6278 of Mathematical Reviews Vol. , Issue 2003h [page]

2003 Mathematical Reviews  
The paper is interesting and is a useful step to- wards powerful polymorphic query languages. Fairouz D.  ...  (English summary) Logic for programming, artificial intelligence, and reasoning (Havana, 2001), 470-484, Lecture Notes in Comput. Sci., 2250, Springer, Berlin, 2001.  ... 

Type Analysis for CHIP [chapter]

Włodzimierz Drabent, Paweł Pietrzak
1998 Lecture Notes in Computer Science  
This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a speci cation that approximates the semantics of a given program.  ...  Our type inference approach is based on bottom-up abstract interpretation, which is used to approximate the declarative semantics (c-semantics).  ...  ACKNOWLEDGMENT The authors want to thank Jan Ma luszy nski for discussions and suggestions.  ... 
doi:10.1007/3-540-49253-4_28 fatcat:f7e7fdbe4nbodgxal2yn3swe2q

Inference of Well-Typings for Logic Programs with Application to Termination Analysis [chapter]

Maurice Bruynooghe, John Gallagher, Wouter Van Humbeeck
2005 Lecture Notes in Computer Science  
This paper develops a method to infer a polymorphic well-typing for a logic program.  ...  Our type inference procedure involves solving set constraints generated from the program and derives a well-typing in contrast to a success-set approximation.  ...  Acknowledgements We wish to thank Tom Schrijvers for finding errors in an earlier draft, and for useful discussions.  ... 
doi:10.1007/11547662_5 fatcat:fs6cdcdhgzgkhgtswybuebx52i

How to Transform an Analyzer into a Verifier [chapter]

Marco Comini, Roberta Gori, Giorgio Levi
2001 Lecture Notes in Computer Science  
The one for logic programs is obtained from a static analyzer on a type domain designed by Codish and Lagoon [3], while the verifier for CLP programs is obtained from the type analyzer described in [15  ...  We prove that the approach is general and flexible by showing three different verification tools based on different domains of types for functional, logic and CLP programming.  ...  This class is a generalization to constraint logic programming of regular unary programs (used by [17, 16] ).  ... 
doi:10.1007/3-540-45653-8_41 fatcat:tpwahaktwnbltcmdaxvikg3qne

Termination Analysis with Types Is More Accurate [chapter]

Vitaly Lagoon, Fred Mesnard, Peter J. Stuckey
2003 Lecture Notes in Computer Science  
In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination of (type correct) programs.  ...  The analysis of the typed logic programs is able to completely reuse a framework for termination analysis of untyped logic programs by using abstract compilation of the type abstraction.  ...  A typed logic program is a logic program where each program variable x is associated with its respective type description type(x).  ... 
doi:10.1007/978-3-540-24599-5_18 fatcat:yc33hvf7zrhb7kzxuefjm227ry

The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231)

Martin Grohe, Venkatesan Guruswami, Stanislav Zivny, Michael Wagner
2018 Dagstuhl Reports  
., polynomial-time solvable, non-trivially approximable, fixed-parameter tractable,  ...  CSPs constitute a very rich and yet sufficiently manageable class of problems to give a good perspective on general computational phenomena.  ...  -The Constraint Satisfaction Problem: Complexity and Approximability From Weak to Strong LP Gaps for all CSPs We study the approximability of constraint satisfaction problems (CSPs) by linear programming  ... 
doi:10.4230/dagrep.8.6.1 dblp:journals/dagstuhl-reports/GroheGZ18 fatcat:3bqo62ly3rgzlnh3bmkvwbuwea

Extending Constructive Logic Negation with Types

Susana Munoz-Hernandez, Juan José Moreno-Navarro
2009 Electronical Notes in Theoretical Computer Science  
Thanks to the use of types, our constructive negation can provide concrete values as results, instead of constraints (as in our previous works).  ...  Negation has traditionally been a difficult issue in Logic Programming. Most of Prolog programmers have been restricted to use just a weak negation technique, like negation as failure.  ...  Regular types, i.e. those described by regular term grammars, satisfy these conditions and have been widely used as types in Logic Programming.  ... 
doi:10.1016/j.entcs.2009.07.022 fatcat:mkprxv4cg5bfphigwd5brecvcy

A practical type analysis for verification of modular prolog programs

Pawel S. Pietrzak, Jesús Correas Fernández, Germán Puebla, Manuel V. Hermenegildo
2008 Proceedings of the 2008 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM '08  
Regular types are a powerful tool for computing very precise descriptive types for logic programs.  ...  We argue that together these two techniques contribute to the practical and scalable analysis and verification of types in Prolog programs.  ...  Ministry of Science and Education under projects TIN2005-09207-C03-01 and 03 MERIT-COMVERS and MERIT-FORMS.  ... 
doi:10.1145/1328408.1328418 dblp:conf/pepm/PietrzakCPH08 fatcat:smxnwz33lzgltbzllh4a5gl2zy

Towards Parameterized Regular Type Inference Using Set Constraints [article]

F. Bueno, J. Navas, M. Hermenegildo
2010 arXiv   pre-print
We propose a method for inferring parameterized regular types for logic programs as solutions for systems of constraints over sets of finite ground Herbrand terms (set constraint systems).  ...  The resulting algorithm, together with a procedure to establish a set constraint system from a logic program, yields a program analysis that infers tighter safe approximations of the success types of the  ...  Zobel [24] also proposes a type inference method for a program, where the type of a logic program is defined as a recursive (regular) superset of its logical consequences.  ... 
arXiv:1002.1836v1 fatcat:dmjhqzliovfyzmxurvalrqy77q

A Typed Hybrid Description Logic Programming Language with Polymorphic Order-Sorted DL-Typed Unification for Semantic Web Type Systems

Adrian Paschke
2007 arXiv   pre-print
In this paper we elaborate on a specific application in the context of hybrid description logic programs (hybrid DLPs), namely description logic Semantic Web type systems (DL-types) which are used for  ...  Using Semantic Web ontologies as type systems facilitates interchange of domain-independent rules over domain boundaries via dynamically typing and mapping of explicitly defined type ontologies.  ...  These descriptive approaches are seeking to approximate the structure of a program for use by an optimizing compiler at compile time.  ... 
arXiv:cs/0610006v2 fatcat:szfxxjpbvzej5jq6mjgbrgnmka

Using parametric set constraints for locating errors in CLP programs [article]

W. Drabent, J. Maluszynski, P. Pietrzak
2002 arXiv   pre-print
This paper introduces a framework of parametric descriptive directional types for constraint logic programming (CLP).  ...  Set-constraint techniques are used for formulating and checking verification conditions for (parametric) polymorphic type specifications.  ...  Acknowledgments We want to thank the anonymous referees for insightful comments and suggestions which resulted in substantial improvements of this paper.  ... 
arXiv:cs/0202010v1 fatcat:viowsmtz35akrhysuawj6dmeje

Control-Flow Analysis of Functional Programs

Jan Midtgaard
2007 BRICS Report Series  
In this paper we survey control-flow analysis of functional programs by structuring the multitude of formulations and approximations and comparing them.  ...  Analyses of the control flow of functional programs have been formulated in multiple settings and have led to many different approximations, starting with the seminal works of Jones, Shivers, and Sestoft  ...  ACKNOWLEDGMENTS This paper benefited from Olivier Danvy and Kevin Millikin's numerous comments and encouragement.  ... 
doi:10.7146/brics.v14i18.21936 fatcat:hgc2ce533zdwrgbprp45axhsce

Control-flow analysis of functional programs

Jan Midtgaard
2012 ACM Computing Surveys  
In this paper, we survey control-flow analysis of functional programs by structuring the multitude of formulations and approximations and comparing them.  ...  Analyses of the control flow of functional programs have been formulated in multiple settings and have led to many different approximations, starting with the seminal works of Jones, Shivers, and Sestoft  ...  ACKNOWLEDGMENTS This paper benefited from Olivier Danvy and Kevin Millikin's numerous comments and encouragement.  ... 
doi:10.1145/2187671.2187672 fatcat:wi4ymuhqgjh6no35q6qvnaf2tm

CHR(Curry): Interpretation and Compilation of Constraint Handling Rules in Curry [chapter]

Michael Hanus
2015 Lecture Notes in Computer Science  
Constraint Handling Rules (CHR) is a rule-based language to specify application-oriented constraint solvers. CHR requires a host language that provides the basic constraints used in a CHR program.  ...  In this paper, we argue that an integrated functional logic language like Curry is an appropriate host language for CHR since it supports a natural formulation of constraint handling rules and a seamless  ...  An important application area of declarative, and in particular, logic programming languages is constraint programming [19, 22] .  ... 
doi:10.1007/978-3-319-19686-2_6 fatcat:e2ekabtxgba3zbgsgznfxzqyze

Directional Type Checking for Logic Programs: Beyond Discriminative Types [chapter]

Witold Charatonik
2000 Lecture Notes in Computer Science  
In the descriptive stream the types are inferred by the system and used to describe semantic properties of untyped programs.  ...  In this paper, using techniques based on tree automata, we show that directional-type checking for logic programs wrt. general regular types is Dexptime-complete and fixed-parameter linear.  ...  Acknowledgments I thank Andreas Podelski for interesting discussions and the anonymous referees for their comments on the paper.  ... 
doi:10.1007/3-540-46425-5_5 fatcat:i2u4dezhi5fnlcn47neyj3srxi
« Previous Showing results 1 — 15 out of 3,512 results