54 search results - page 4 / 11 » Non-termination Inference for Constraint Logic Programs |
157
Voted
ICTAI
2008
IEEE
16 years 7 days ago
2008
IEEE
Boolean satisfiability (SAT) finds a wide range of practical applications, including Artificial Intelligence and, more recently, Bioinformatics. Although encoding some combinat...
161
Voted
SEMCO
2007
IEEE
16 years 2 days ago
2007
IEEE
Many recent advances in complex domains such as Natural Language Processing (NLP) have taken a discriminative approach in conjunction with the global application of structural and...
182
click to vote
FROCOS
2009
Springer
15 years 10 months ago
2009
Springer
We discuss a new concept of agent programs that combines logic programming with reasoning about actions. These agent logic programs are characterized by a clear separation between ...
256
Voted
POPL
2002
ACM
16 years 6 months ago
2002
ACM
Functional logic overloading is a novel approach to userdefined overloading that extends Haskell's concept of type classes in significant ways. Whereas type classes are conce...
157
click to vote
ICFP
2003
ACM
16 years 5 months ago
2003
ACM
To improve the quality of type error messages in functional programming languages, we propose four techniques which influence the behaviour of constraint-based type inference proc...