275 search results - page 5 / 55 » Non-Termination Inference of Logic Programs |
JELIA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. The growing size of electronically available text corpora like companies’ intranets or the WWW has made information access a hot topic within computational linguistics....
ICLP
2010
Springer
15 years 1 months ago
2010
Springer
ABSTRACT. Action-probabilistic logic programs (ap-programs) are a class of probabilistic logic programs that have been extensively used during the last few years for modeling behav...
101
Voted
PPCP
1993
15 years 1 months ago
1993
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
TOCL
2008
14 years 9 months ago
2008
103
click to vote
ICSE
2011
IEEE-ACM
14 years 1 months ago
2011
IEEE-ACM
A raw object is partially initialized, with only some fields set to legal values. It may violate its object invariants, such as that a given field is non-null. Programs often ma...