Possibilistic semantics for logic programs with ordered disjunction
FoIKS'10 Proceedings of the 6th international conference on Foundations of Information and Knowledge Systems
Answer set modules for logical agents
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
Conflict, consistency and truth-dependencies in graph representations of answer set logic programs
GKR'11 Proceedings of the Second international conference on Graph Structures for Knowledge Representation and Reasoning
Complex reactivity with preferences in rule-based agents
RuleML'12 Proceedings of the 6th international conference on Rules on the Web: research and applications
Nested Weight Constraints in ASP
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
| Hi-index | 0.00 |
LPNMR is based on very solid theoretical foundations. After nearly twenty years of research, LPNMR languages are expressively rich, and their semantic and computational properties are well understood today. Moreover, in the last decade the LPNMR community has focused also on systems implementation, and, after the pioneering work carried out in DLV and Smodels, many efficient LPNMR systems are now available. The main challenge of LPNMR now concerns applications. Two key questions are: -Is LPNMR technology mature enough for the development of industrial applications? -Can LPNMR be attractive also for the market? In this talk, we will address the above questions. We will report also some feedback that we have got "from the field", in the collaboration with a Calabrian spin-off company, which is developing three Knowledge Management products based on the DLV system, in a joint venture with a US company. We will present our vision on the future development of LPNMR, pointing out promising application areas where LPNMR can be profitably exploited, and specifying the key theoretical and practical issues to be addressed in order to enhance the applicability of LPNMR.