{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:30:06Z","timestamp":1777645806331,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[1995,6]]},"abstract":"<jats:p>We propose a technique for dealing with the high complexity of reasoning under propositional default logic and circumscription. The technique is based on the notion of approximation: A logical consequence relation is computed by means of sound and progressively \u201cmore complete\u201d relations, as well as complete and progressively \u201cmore sound\u201d ones. Both sequences generated in this way converge to the original consequence relation and are easier to compute. Moreover they are given a clear semantics based on multivalued logic. With this technique unsoundness and incompleteness are introduced in a controlled way and precisely characterized.<\/jats:p>","DOI":"10.3233\/fi-1995-2316","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T20:37:16Z","timestamp":1575319036000},"page":"123-143","source":"Crossref","is-referenced-by-count":7,"title":["APPROXIMATE INFERENCE IN DEFAULT LOGIC AND CIRCUMSCRIPTION"],"prefix":"10.1177","volume":"23","author":[{"given":"Marco","family":"Cadoli","sequence":"first","affiliation":[{"name":"Dipartimento di Informatica e Sistemistica,Universit\u00e0 di Roma \u201cLa Sapienza\u201d via Salaria 113, 1-00198 \/Roma, Italia cadoli@dis.uniromal.it schaerf@dis.uniromal.it"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Schaerf","sequence":"additional","affiliation":[{"name":"Dipartimento di Informatica e Sistemistica,Universit\u00e0 di Roma \u201cLa Sapienza\u201d via Salaria 113, 1-00198 \/Roma, Italia cadoli@dis.uniromal.it schaerf@dis.uniromal.it"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[1995,1,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-1995-2316","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-1995-2316","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:33:22Z","timestamp":1777444402000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-1995-2316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1,1]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["10.3233\/FI-1995-2316"],"URL":"https:\/\/doi.org\/10.3233\/fi-1995-2316","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,1,1]]}}}