1131 search results - page 97 / 227 » Logic Programming, Functional Programming, and Inductive Def... |
HASKELL
2009
ACM
15 years 7 months ago
2009
ACM
Even Haskell programs can occasionally go wrong. Programs calling head on an empty list, and incomplete patterns in function definitions can cause program crashes, reporting littl...
109
Voted
JFPLC
2000
15 years 1 months ago
2000
ABSTRACT. This paper focuses on the assignment of meaning to some nonterminating SLD derivations in logic programming. Several approaches have been developped by considering infini...
ICML
2005
IEEE
16 years 1 months ago
2005
IEEE
Markov logic networks (MLNs) combine logic and probability by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. In this pap...
123
click to vote
CADE
2004
Springer
16 years 26 days ago
2004
Springer
Formal semantic definitions of concurrent languages, when specified in a well-suited semantic framework and supported by generic and efficient formal tools, can be the basis of pow...
77
Voted
ICALP
2010
Springer
15 years 5 months ago
2010
Springer
We prove that TAUT has a p-optimal proof system if and only if a logic related to least fixed-point logic captures polynomial time on all finite structures. Furthermore, we show ...