Using Lightweight Inference to Solve Lightweight Problems

Authors:
Marc Denecker;Joost Vennekens
Affiliations:
Dept. Computerscience, K.U. Leuven, Heverlee, Belgium B-3001;Dept. Computerscience, K.U. Leuven, Heverlee, Belgium B-3001
Venue:
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Year:
2009

Citing 3
Cited 0

A logical framework for configuration software

PPDP '09 Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming
The Second Answer Set Programming Competition

LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
A framework for representing and solving NP search problems

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

Traditionally, Logic Programming and related Non-monotonic Reasoning formalisms have mainly been applied to "hard" AI problems, such as planning, scheduling, constraint solving, belief revision, etc. In the real world of software engineering, however, these hard problems are vastly outnumbered by more mundane tasks. A significant part of software that is written today consists of applications that any reasonably experienced programmer could write in a couple of weeks, using whatever imperative language happens to be the industry standard du jour .