3481 search results - page 403 / 697 » Higher-Order Logic Programming as Constraint Logic Programmi... |
156
click to vote
AMAI
2006
Springer
15 years 4 months ago
2006
Springer
The theorem on loop formulas due to Fangzhen Lin and Yuting Zhao shows how to turn a logic program into a propositional formula that describes the program's stable models. In...
110
click to vote
ENTCS
2008
15 years 4 months ago
2008
We report our experience with exploring a new point in the design space for formal reasoning systems: the development of the programming language mega. mega is intended as both a ...
171
click to vote
ILP
2007
Springer
15 years 11 months ago
2007
Springer
We describe an application of inductive logic programming to transfer learning. Transfer learning is the use of knowledge learned in a source task to improve learning in a related ...
161
click to vote
TPHOL
2005
IEEE
15 years 10 months ago
2005
IEEE
The nominal approach to abstract syntax deals with the issues of bound names and α-equivalence by considering constructions and properties that are invariant with respect to permu...
152
click to vote
ENTCS
2007
15 years 4 months ago
2007
We introduce the idea of optimisation validation, which is to formally establish that an instance of an optimising transformation indeed improves with respect to some resource mea...