211 search results - page 34 / 43 » The Representation of Program Synthesis in Higher Order Logi... |
101
click to vote
TPHOL
1999
IEEE
15 years 1 months ago
1999
IEEE
Abstract. We describe the key features of the proof description language of Declare, an experimental theorem prover for higher order logic. We take a somewhat radical approach to p...
PKDD
2007
Springer
15 years 3 months ago
2007
Springer
This paper presents a novel method for multi-relational classification via an aggregation-based Inductive Logic Programming (ILP) approach. We extend the classical ILP representati...
DAC
2003
ACM
15 years 10 months ago
2003
ACM
Cyclic circuits that do not hold state or oscillate are often the most convenient representation for certain functions, such as arbiters, and can easily be produced inadvertently ...
89
Voted
ENTCS
2002
14 years 9 months ago
2002
Abstract: Alias analysis for Fortran is less complicated than for programming languages with pointers but many real Fortran programs violate the standard: a formal parameter or a c...
APWEB
2006
Springer
15 years 1 months ago
2006
Springer
In the semantic web context,the formal representation of knowledge is not resourceful while the informal one with uncertainty prevails. In order to provide an uncertainty reasoning...