We give an overview of the coinductive logic programming paradigm. We discuss its applications to modeling ω-automata, model checking, verification, non-monotonic reasoning, developing SAT solvers, etc. We also discuss future research directions.
A requirements speciication is the rst formal description of a program. Formal methods of program construction can be practically useful only when the requirements speciication can be shown to be adequate. This must be done by informal means: inspection and testing. Current speciication languages do not easily support both inspection and testing. We propose… (More)