{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T20:42:29Z","timestamp":1648845749115},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Semantic Computing"],"published-print":{"date-parts":[[2011,9]]},"abstract":"<jats:p> Representing knowledge in a rule-based system takes place by means of \"if\u2026then\u2026\" statements. These are called production rules for the reason that new information is produced when the rule fires. The logic attached to rule-based systems is taken to be classical inasmuch as \"if\u2026then\u2026\" is encoded by material implication. However, it appears that the notion of triggering \"if\u2026then\u2026\" amounts to different logical definitions. The paper investigates the matter, with an emphasis upon consistency because reading \"if\u2026 then\u2026\" statements as rules calls for a notion of rule consistency that does not conform with consistency in the classical sense. Natural deduction is used to explore entailment and equivalence among various formulations and properties. <\/jats:p>","DOI":"10.1142\/s1793351x11001250","type":"journal-article","created":{"date-parts":[[2012,2,21]],"date-time":"2012-02-21T10:39:53Z","timestamp":1329820793000},"page":"271-280","source":"Crossref","is-referenced-by-count":2,"title":["A LOGICAL ANALYSIS OF RULE INCONSISTENCY"],"prefix":"10.1142","volume":"05","author":[{"given":"PHILIPPE","family":"BESNARD","sequence":"first","affiliation":[{"name":"IRIT, CNRS (UMR 5505), Universit\u00e9 de Toulouse, 118 route de Narbonne, F-31062 Toulouse, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,4,7]]},"reference":[{"key":"rf1","volume-title":"Entailment: The Logic of Relevance and Necessity","volume":"1","author":"Anderson A. R.","year":"1975"},{"key":"rf2","unstructured":"H. K.\u00a0B\u00fcning and U.\u00a0Bubeck, Handbook of Satisfiability, eds. A.\u00a0Biere (IOS Press, 2009)\u00a0pp. 735\u2013760."},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85108-0"},{"key":"rf4","volume-title":"A Mathematical Introduction to Logic","author":"Enderton H. B.","year":"2012"},{"key":"rf5","volume-title":"Completeness Theory for Propositional Logics","author":"Pogorzelski W. A.","year":"2008"},{"key":"rf6","volume-title":"Natural Deduction","author":"Prawitz D.","year":"1965"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.2307\/2270055"},{"key":"rf8","volume-title":"Artificial Intelligence: A Modern Approach","author":"Russell S. J.","year":"2010"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(89)90106-0"}],"container-title":["International Journal of Semantic Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S1793351X11001250","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T17:48:03Z","timestamp":1565200083000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S1793351X11001250"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9]]},"references-count":9,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2012,4,7]]},"published-print":{"date-parts":[[2011,9]]}},"alternative-id":["10.1142\/S1793351X11001250"],"URL":"https:\/\/doi.org\/10.1142\/s1793351x11001250","relation":{},"ISSN":["1793-351X","1793-7108"],"issn-type":[{"value":"1793-351X","type":"print"},{"value":"1793-7108","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,9]]}}}