{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T18:38:34Z","timestamp":1725993514023},"reference-count":45,"publisher":"Elsevier","isbn-type":[{"type":"print","value":"9780128114322"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1016\/b978-0-12-809633-8.20330-0","type":"book-chapter","created":{"date-parts":[[2018,2,16]],"date-time":"2018-02-16T00:31:51Z","timestamp":1518741111000},"page":"294-299","source":"Crossref","is-referenced-by-count":0,"title":["Knowledge and Reasoning"],"prefix":"10.1016","author":[{"given":"Francesco","family":"Ricca","sequence":"first","affiliation":[]},{"given":"Giorgio","family":"Terracina","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/B978-0-12-809633-8.20330-0_bib1","series-title":"LPNMR, volume 9345 of Lecture Notes in Computer Science","article-title":"Advances in WASP","author":"Alviano","year":"2015"},{"issue":"4-5","key":"10.1016\/B978-0-12-809633-8.20330-0_bib2","first-page":"755","article-title":"Anytime computation of cautious consequences in answer set programming","volume":"14","author":"Alviano","year":"2014","journal-title":"TPLP"},{"year":"2003","author":"Apt","series-title":"Principles of Constraint Programming","key":"10.1016\/B978-0-12-809633-8.20330-0_bib3"},{"year":"2003","series-title":"The Description Logic Handbook: Theory, Implementation, and Applications","key":"10.1016\/B978-0-12-809633-8.20330-0_bib4"},{"issue":"1","key":"10.1016\/B978-0-12-809633-8.20330-0_bib5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1013882326814","article-title":"An overview of tableau algorithms for description logics","volume":"69","author":"Baader","year":"2001","journal-title":"Studia Logica"},{"key":"10.1016\/B978-0-12-809633-8.20330-0_bib6","series-title":"LPNMR, volume 2173 of Lecture Notes in Computer Science","article-title":"The USA-advisor: A case study in answer set planning","author":"Balduccini","year":"2001"},{"key":"10.1016\/B978-0-12-809633-8.20330-0_bib7","series-title":"JELIA, volume 8761 of Lecture Notes in Computer Science","article-title":"Improving the normalization of weight rules in answer set programs","author":"Bomanson","year":"2014"},{"issue":"4","key":"10.1016\/B978-0-12-809633-8.20330-0_bib8","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10817-007-9082-1","article-title":"Inferring phylogenetic trees using answer set programming","volume":"39","author":"Brooks","year":"2007","journal-title":"J. Autom. Reasoning"},{"issue":"1","key":"10.1016\/B978-0-12-809633-8.20330-0_bib9","doi-asserted-by":"crossref","first-page":"5","DOI":"10.3233\/IA-170104","article-title":"I-DLV: The new intelligent grounder of DLV","volume":"11","author":"Calimeri","year":"2017","journal-title":"Intelligenza Artificiale"},{"key":"10.1016\/B978-0-12-809633-8.20330-0_bib10","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.artint.2015.09.008","article-title":"Design and results of the fifth answer set programming competition","volume":"231","author":"Calimeri","year":"2016","journal-title":"Artif. Intell."},{"key":"10.1016\/B978-0-12-809633-8.20330-0_bib11","series-title":"Handbook of Automated Reasoning","article-title":"Reasoning in expressive description logics","author":"Calvanese","year":"2001"},{"issue":"5","key":"10.1016\/B978-0-12-809633-8.20330-0_bib12","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1080\/0952813X.2014.993503","article-title":"A declarative concurrent system for protein structure prediction on GPU","volume":"27","author":"Campeotto","year":"2015","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"10.1016\/B978-0-12-809633-8.20330-0_bib13","series-title":"Logic-Based Artificial Intelligence","first-page":"79","article-title":"Declarative problem-solving using the DLV system","author":"Eiter","year":"2000"},{"issue":"5","key":"10.1016\/B978-0-12-809633-8.20330-0_bib14","first-page":"539","article-title":"Vladimir Lifschitz, and Donald Ringe. Temporal phylogenetic networks and logic programming","volume":"6","author":"Erdem","year":"2006","journal-title":"TPLP"},{"key":"10.1016\/B978-0-12-809633-8.20330-0_bib15","series-title":"LPNMR, volume 5753 of Lecture Notes in Computer Science","article-title":"HAPLO-ASP: Haplotype inference using answer set programming","author":"Erdem","year":"2009"},{"issue":"3","key":"10.1016\/B978-0-12-809633-8.20330-0_bib16","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1609\/aimag.v37i3.2678","article-title":"Applications of answer set programming","volume":"37","author":"Erdem","year":"2016","journal-title":"AI Magazine"},{"issue":"1","key":"10.1016\/B978-0-12-809633-8.20330-0_bib17","first-page":"35","article-title":"Generating explanations for biomedical queries","volume":"15","author":"Erdem","year":"2015","journal-title":"TPLP"},{"year":"2003","author":"Fr\u00fchwirth","series-title":"Essentials of constraint programming. Cognitive Technologies","key":"10.1016\/B978-0-12-809633-8.20330-0_bib18"},{"issue":"4-5","key":"10.1016\/B978-0-12-809633-8.20330-0_bib19","first-page":"434","article-title":"Improved answer-set programming encodings for abstract argumentation","volume":"15","author":"Gaggl","year":"2015","journal-title":"TPLP"},{"key":"10.1016\/B978-0-12-809633-8.20330-0_bib20","series-title":"LPNMR, volume 9345 of Lecture Notes in Computer Science","article-title":"Progress in clasp series 3","author":"Gebser","year":"2015"},{"issue":"2","key":"10.1016\/B978-0-12-809633-8.20330-0_bib21","doi-asserted-by":"crossref","first-page":"107","DOI":"10.3233\/AIC-2011-0491","article-title":"Potassco: The potsdam answer set solving collection","volume":"24","author":"Gebser","year":"2011","journal-title":"AI Commun"},{"key":"10.1016\/B978-0-12-809633-8.20330-0_bib22","series-title":"AAAI","article-title":"What\u05f3s hot in the answer set programming competition","author":"Gebser","year":"2016"},{"issue":"2-3","key":"10.1016\/B978-0-12-809633-8.20330-0_bib23","first-page":"323","article-title":"Detecting inconsistencies in large biological networks with answer set programming","volume":"11","author":"Gebser","year":"2011","journal-title":"TPLP"},{"issue":"3\/4","key":"10.1016\/B978-0-12-809633-8.20330-0_bib24","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF03037169","article-title":"Classical negation in logic programs and disjunctive databases","volume":"9","author":"Gelfond","year":"1991","journal-title":"New Generation Comput"},{"issue":"6","key":"10.1016\/B978-0-12-809633-8.20330-0_bib25","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1093\/analys\/23.6.121","article-title":"Is justified true belief knowledge?","volume":"23","author":"Gettier","year":"1963","journal-title":"Analysis"},{"year":"2001","author":"Goble","series-title":"The Blackwell guide to philosophical logic","key":"10.1016\/B978-0-12-809633-8.20330-0_bib26"},{"key":"10.1016\/B978-0-12-809633-8.20330-0_bib27","series-title":"Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, volume 6565 of Lecture Notes in Computer Science","article-title":"ASP at work: Spin-off and applications of the DLV system","author":"Grasso","year":"2011"},{"year":"2005","author":"Hentenryck","series-title":"Constraint-based local search","key":"10.1016\/B978-0-12-809633-8.20330-0_bib28"},{"year":"1962","author":"Hintikka","series-title":"Knowledge and Belief","key":"10.1016\/B978-0-12-809633-8.20330-0_bib29"},{"issue":"4-5","key":"10.1016\/B978-0-12-809633-8.20330-0_bib30","first-page":"569","article-title":"claspfolio 2: Advances in algorithm selection for answer set programming","volume":"14","author":"Hoos","year":"2014","journal-title":"TPLP"},{"issue":"3","key":"10.1016\/B978-0-12-809633-8.20330-0_bib31","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1609\/aimag.v37i3.2672","article-title":"Grounding and solving in answer set programming","volume":"37","author":"Kaufmann","year":"2016","journal-title":"AI Magazine"},{"issue":"12","key":"10.1016\/B978-0-12-809633-8.20330-0_bib32","doi-asserted-by":"crossref","first-page":"1514","DOI":"10.1016\/j.dam.2006.10.004","article-title":"The state of SAT","volume":"155","author":"Kautz","year":"2007","journal-title":"Discrete Appl Math"},{"issue":"4-5","key":"10.1016\/B978-0-12-809633-8.20330-0_bib33","first-page":"604","article-title":"Optimizing phylogenetic supertrees using answer set programming","volume":"15","author":"Koponen","year":"2015","journal-title":"TPLP"},{"issue":"3","key":"10.1016\/B978-0-12-809633-8.20330-0_bib34","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/1149114.1149117","article-title":"The DLV system for knowledge representation and reasoning","volume":"7","author":"Leone","year":"2006","journal-title":"ACM Trans. Comput. Log."},{"key":"10.1016\/B978-0-12-809633-8.20330-0_bib35","series-title":"ICLP (Technical Communications), 17 of LIPIcs","article-title":"ASP at work: An ASP implementation of phylows","author":"Le","year":"2012"},{"issue":"4-5","key":"10.1016\/B978-0-12-809633-8.20330-0_bib36","first-page":"696","article-title":"Taming primary key violations to query large inconsistent data via ASP","volume":"15","author":"Manna","year":"2015","journal-title":"TPLP"},{"issue":"6","key":"10.1016\/B978-0-12-809633-8.20330-0_bib37","first-page":"841","article-title":"A multi-engine approach to answer-set programming","volume":"14","author":"Maratea","year":"2014","journal-title":"TPLP"},{"key":"10.1016\/B978-0-12-809633-8.20330-0_bib38","series-title":"LPNMR, volume 9345 of Lecture Notes in Computer Science","article-title":"Multi-level algorithm selection for ASP","author":"Maratea","year":"2015"},{"issue":"6","key":"10.1016\/B978-0-12-809633-8.20330-0_bib39","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1016\/j.datak.2010.01.005","article-title":"The consistency extractor system: Answer set programs for consistent query answering in databases","volume":"69","author":"Marileo","year":"2010","journal-title":"Data Knowl. Eng."},{"unstructured":"McCarthy, J., 1958. Programs with common sense. In: Proceedings of the Teddington Conference on the Mechanisation of Thought Processes, pp. 77\u201384.","key":"10.1016\/B978-0-12-809633-8.20330-0_bib40"},{"year":"2009","author":"Michel","series-title":"Graph-based Knowledge Representation \u2013 Computational Foundations of Conceptual Graphs. Advanced Information and Knowledge Processing","key":"10.1016\/B978-0-12-809633-8.20330-0_bib41"},{"issue":"3","key":"10.1016\/B978-0-12-809633-8.20330-0_bib42","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/j.jal.2008.10.001","article-title":"Hypothesizing about signaling networks","volume":"7","author":"Nam","year":"2009","journal-title":"J. Applied Logic"},{"issue":"3-4","key":"10.1016\/B978-0-12-809633-8.20330-0_bib43","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1023\/A:1018930122475","article-title":"Logic programs with stable model semantics as a constraint programming paradigm","volume":"25","author":"Niemel\u00e4","year":"1999","journal-title":"Ann. Math. Artif. Intell."},{"issue":"1","key":"10.1016\/B978-0-12-809633-8.20330-0_bib44","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A machine-oriented logic based on the resolution principle","volume":"12","author":"Robinson","year":"1965","journal-title":"J. ACM"},{"issue":"4","key":"10.1016\/B978-0-12-809633-8.20330-0_bib45","first-page":"395","article-title":"Computing minimal models, stable models and answer sets","volume":"6","author":"Zbigniew","year":"2006","journal-title":"TPLP"}],"container-title":["Encyclopedia of Bioinformatics and Computational Biology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780128096338203300?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780128096338203300?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,10,28]],"date-time":"2020-10-28T06:05:37Z","timestamp":1603865137000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780128096338203300"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9780128114322"],"references-count":45,"URL":"https:\/\/doi.org\/10.1016\/b978-0-12-809633-8.20330-0","relation":{},"subject":[],"published":{"date-parts":[[2019]]}}}