{"type":"ScholarlyArticle","title":"Resource-bounded inference from inconsistent belief bases","authors":[{"name":"Pierre Marquis","slug":"pierre-marquis","given":"Pierre","family":"Marquis","affiliation":""},{"name":"Nadège Porquet","slug":"nadege-porquet","given":"Nadège","family":"Porquet","affiliation":""}],"abstract":"A family of resource-bounded paraconsistent inference relations is introduced. These relations are based on S - 3 entailment, an inference relation logically weaker than classical entailment and parametrized by a set S of variables. Their properties are investigated, especially from the computational complexity point of view. Among the strong features of our framework is the fact that tractability is ensured each time S is bounded and that binary connectives behave in a classical manner. Moreover, our family is large enough to include both S - 3 inference, the standard inference relations based on the selection of consistent subbases and some additional forms of paraconsistent reasoning as specific cases.","doi":null,"url":"https://ijcai.org/proceedings/2001/14","pdf":"https://ijcai.org/proceedings/2001/0014.pdf","markdown":"https://ijcai.org/proceedings/2001/14.md","bibtex":"https://ijcai.org/proceedings/2001/bibtex/14","volume":{"slug":"2001","title":"Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2001","url":"https://ijcai.org/proceedings/2001/","year":2001,"location":"Seattle, Washington, USA","dates":"","editors":"","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":14,"pages":{"first":103,"last":107},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}