662 search results - page 25 / 133 » Logic Programming with Ordered Disjunction |
ICLP
1995
Springer
15 years 4 months ago
1995
Springer
The purpose of this paper is to study the problem of complete type inferencing for polymorphic order-sorted logic programs. We show that previous approaches are incomplete even if...
114
click to vote
IJCAI
2007
15 years 2 months ago
2007
We present a fully connectionist system for the learning of first-order logic programs and the generation of corresponding models: Given a program and a set of training examples,...
130
click to vote
TLCA
2007
Springer
15 years 7 months ago
2007
Springer
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...
133
click to vote
TAP
2010
Springer
14 years 11 months ago
2010
Springer
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
167
click to vote
PTS
2010
14 years 11 months ago
2010
We present a novel algorithm for test data generation that is based on techniques used in formal software verification. Prominent examples of such formal techniques are symbolic ex...