393 search results - page 55 / 79 » Logic Programs with Classical Negation |
ICFP
2012
ACM
11 years 11 months ago
2012
ACM
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
PPDP
2007
Springer
14 years 2 months ago
2007
Springer
Non-confluent and non-terminating rewrite systems are interesting from the point of view of programming. In particular, existing functional logic languages use such kind of rewri...
IFIP
2009
Springer
13 years 6 months ago
2009
Springer
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...
ILP
2004
Springer
14 years 1 months ago
2004
Springer
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. Our research has focused on Information Extraction (IE), a task that typically invol...
AIML
2004
13 years 10 months ago
2004
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...