1017 search results - page 162 / 204 » Higher-Order Logic Programming Languages with Constraints: A... |
JUCS
2006
14 years 9 months ago
2006
: We present a tutorial of the ITP tool, a rewriting-based theorem prover that can be used to prove inductive properties of membership equational specifications. We also introduce ...
75
Voted
CORR
2004
Springer
14 years 9 months ago
2004
Springer
Abstraction by Typing Andrew D. Gordon Microsoft Research Riccardo Pucella Cornell University An XML web service is, to a first approximation, an RPC service in which requests and...
JAPLL
2010
14 years 8 months ago
2010
Semantic web applications based on the web ontology language (OWL) often require the use of numbers in class descriptions for expressing cardinality restrictions on properties or ...
146
Voted
ICLP
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The overhead of matching CHR rules is alleviated by constraint store indexing. Attributed variables provide an efficient means of indexing on logical variables. Existing ...
PPDP
2005
Springer
15 years 3 months ago
2005
Springer
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...