A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
Type dependencies for logic programs using ACI-unification

2000
*
Theoretical Computer Science
*

The generation of

doi:10.1016/s0304-3975(98)00122-4
fatcat:ks3gowvd3bbibnjew5lcijsxze
*type**dependencies**for*a*logic**program*is fully automatic with respect to a given domain of*types*. ...*Type**dependencies*are obtained by abstracting*programs*, replacing concrete terms by their*types*, and evaluating the meaning of the abstract*programs**using*a standard semantics*for**logic**programs*enhanced ... Giorgio Levi insisted that we check that the domain of symbolic*types*is condensing. Robert Constable, Saumya Debray, John Gallagher and Roberto Giacobazzi made*useful*comments on an earlier version. ...##
###
Page 6640 of Mathematical Reviews Vol. , Issue 2001I
[page]

2001
*
Mathematical Reviews
*

*dependencies*

*for*

*logic*

*programs*

*using*

*ACI*-

*unification*. ... The paper introduces

*type*

*dependences*

*for*

*logic*

*programs*by AClI-

*unification*. ...

##
###
Page 4681 of Mathematical Reviews Vol. , Issue 97H
[page]

1997
*
Mathematical Reviews
*

As the main part of the paper, we propose an AC

*unification*algorithm*for*pure patterns, which is parametrized by a first-order*ACI**unification*algorithm. ... In practice, our algorithm can be*used*to extend higher-order*logic**programming*and proof systems by adding AC operators.” ...##
###
Analysis of Polymorphically Typed Logic Programs Using ACI-Unification
[chapter]

2001
*
Lecture Notes in Computer Science
*

This approach worked

doi:10.1007/3-540-45653-8_19
fatcat:x2ee6awnajh4xoiyzdpq3nwtle
*for*polymorphically*typed**logic**programs*. Here, we recast this approach following [5, 11] . ...*For*the analysis,*programs*are executed on abstract terms instead of the concrete ones, and usual*unification*is replaced by*unification*modulo an equality theory which includes the well-known*ACI*-theory ... Acknowledgements I want to thank the anonymous referees*for*their helpful comments. This research was mostly carried out while I was an ERCIM fellow at CWI Amsterdam. ...##
###
Page 2861 of Mathematical Reviews Vol. , Issue 2003d
[page]

2003
*
Mathematical Reviews
*

(249-265); Carsten Schiirmann, A

*type*-theoretic approach to induction with higher-order encodings (266-281); Jan-Georg Smaus, Analysis of polymorphically*typed**logic**programs**using**ACI*-*unification*(282 ... Fermiiller, Herbrand’s theorem*for*prenex Gédel*logic*and its consequences*for*theorem proving (201-216); Franz Baader and Ralf Kiisters,*Unification*in a description*logic*with transitive closure of roles ...##
###
Towards a Behavioral-Matching Based Compilation of Synthetic Biology Functions

2015
*
Acta Biotheoretica
*

In this undertaking, Computer-Aided-Design (CAD) environments should play a central role

doi:10.1007/s10441-015-9265-9
pmid:26141968
pmcid:PMC4531147
fatcat:whso5tz2vrd73c54vngtwgeh5q
*for*facilitating the design. ... The compiler appropriately selects components such that the observation of the synthetic biological function resulting to their assembly complies to the*programmed*behaviour. ... Acknowledgments The funding*for*most this work is granted by the ANR SYNBIOTIC (030701). ...##
###
Set unification

2006
*
Theory and Practice of Logic Programming
*

In particular we present a new goal-driven algorithm

doi:10.1017/s1471068406002730
fatcat:gh373w3iqvfejph3jy4lzeniha
*for*general*ACI**unification*and a new algorithm (with a simple termination proof)*for*general (Ab)(Cℓ)*unification*. ... complex problems-e.g.,*unification*between general*ACI*terms. ... The algorithm of Figure 5 is derived from that*used*in the language {log}, a*logic**programming*language enriched with finite sets [16] . ...##
###
Set Unification
[article]

2005
*
arXiv
*
pre-print

In particular, we present a new goal-driven algorithm

arXiv:cs/0110023v2
fatcat:hcwwa75ubfemng2ooxq5mhtxru
*for*general ACI1*unification*and a new simpler algorithm*for*general (Ab)(Cl)*unification*. ... This provides also the ability to classify different*types*of set*unification*problems.*Unification*algorithms are uniformly proposed to solve the*unification*problem in each of such classes. ... Acknowledgments We thank the anonymous referees that helped*us*to improve the quality of presentation of the paper. The research presented in this paper has benefited from discussions with A. ...##
###
Efficient run-time type checking of typed logic programs

1992
*
The Journal of Logic Programming
*

Let P be the

doi:10.1016/0743-1066(92)90046-6
fatcat:lxmysccwxngw3h3rr7gzmvjnqy
*program*and D the*type*declaration in Example 2.2. Then P is well*typed*with respect to D, and the following are well*typed*with respect to D. ... The same method can be*used**for*deriving*type**dependencies**for**programs*containing recursive definitions. ... These operators are*used*in Section 6.2 to buildup an algorithm*for*generating*type**dependencies**for*a*program*. ...##
###
Analysis of Polymorphically Typed Logic Programs Using ACI-Unification
[article]

2001
*
arXiv
*
pre-print

*For*the analysis,

*programs*are executed on abstract terms instead of the concrete ones, and usual

*unification*is replaced by

*unification*modulo an equality theory which includes the well-known

*ACI*-theory ...

*type*declarations of a

*program*can be

*used*to characterise the degree of instantiation of a term in a precise and yet inherently finite way. ... Preliminaries The reader is assumed to be familiar with the basics of

*logic*

*programming*[Llo87] . We

*use*a

*type*system

*for*

*logic*

*programs*with parametric polymorphism [DMGMS99, HL94, SHC96] . ...

##
###
Unification theory

1989
*
Journal of symbolic computation
*

*Unification*theory provides the formal framework

*for*investigations into the properties of this operation. ... This article surveys what is presently known in

*unification*theory and records its early history. 20g ... In particular the

*type*of a

*unification*problem, as defined below,

*depends*on both E and T. ...

##
###
First-order unification using variable-free relational algebra

2010
*
Logic Journal of the IGPL
*

This important equivalence allows

doi:10.1093/jigpal/jzq011
fatcat:mg7jrsa43zejlcjhb4oanwq4i4
*us*to formalize*logic**programs*as relational expressions. ... We focus on the encoding of terms within this framework, which serves as an essential data*type**for*our algorithm. In the second part of the paper, we present the*unification*algorithm. ... Acknowledgements We thank the anonymous referees*for*their insightful comments. ...##
###
GUBS, a Behaviour-Based Language for Design in Synthetic Biology

2013
*
Scientific Annals of Computer Science
*

In contrast to a closed system, a

doi:10.7561/sacs.2013.1.1
fatcat:64kqze6enne43lq6wsp7mwa42a
*program*is always a partial description of the behaviour of the system. ... The semantics of the language accounts the existence of some hidden non-specified actions that possibly alter the behaviour of the*programmed*devices. ... Cerrito and Amelie David*for*their helpful comments. ...##
###
How to Transform an Analyzer into a Verifier
[chapter]

2001
*
Lecture Notes in Computer Science
*

The one

doi:10.1007/3-540-45653-8_41
fatcat:tpwahaktwnbltcmdaxvikg3qne
*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*. ...*Type*Verification in*Logic*Languages In this section we will show an example of transformation of an analyzer*for**logic**programming*into a verifier. ...##
###
Representing and Reasoning with Operational Semantics
[chapter]

2006
*
Lecture Notes in Computer Science
*

Such

doi:10.1007/11814771_3
fatcat:hchq5eocyfabjpxthzilp6voge
*logical*encodings of operational semantics can be surprisingly declarative if one*uses**logics*that directly account*for*term-level bindings and*for*resources, such as are found in linear*logic*. ... The operational semantics of*programming*and specification languages is often presented via inference rules and these can generally be mapped into*logic**programming*-like clauses. ... This paper reflects only the author's views and the Community is not liable*for*any*use*that may be made of the information contained therein. ...
« Previous

*Showing results 1 — 15 out of 446 results*