IDP is a knowledge Base System (KB-system) for the FO(·) language. A Knowledge Base system is a system that supports multiple forms of inferences for he same Knowledge Base. FO(·) is an extension of first-order logic (FO) with types, aggregates, inductive definitions, bounded arithmetic, partial functions, etc. More information about FO(·), including an editorial by David Warren, can be found on the FO(·) language page. For a motivation of the Knowledge Base paradigm, see an application for interactive configuration. Using IDP, it is possible to model systems and problems, both from the real world as several artificial intelligence research problems. Solutions to these problems can then be found using one or more inference techniques. One class of real world problems that serves as a nice introduction to IDP is a scheduling problem.
Keywords for this software
References in zbMATH (referenced in 5 articles )
Showing results 1 to 5 of 5.
- Lierler, Yuliya: What is answer set programming to propositional satisfiability (2017)
- Bruynooghe, Maurice; Blockeel, Hendrik; Bogaerts, Bart; De Cat, Broes; De Pooter, Stef; Jansen, Joachim; Labarre, Anthony; Ramon, Jan; Denecker, Marc; Verwer, Sicco: Predicate logic as a modeling language: modeling and solving some machine learning and data mining problems with IDP3 (2015)
- Lierler, Yuliya: Relating constraint answer set programming languages and algorithms (2014)
- Wittocx, Johan; Vlaeminck, Hanne; Denecker, Marc: Debugging for model expansion (2009)
- Mitchell, David G.; Ternovska, Eugenia: Expressive power and abstraction in Essence (2008)