NDLI: Nonmonotonic reasoning: from complexity to algorithms

Content Provider	Springer Nature Link
Author	Cayrol, C. Lagasquie‐Schiex, M.‐C. Schiex, T.
Copyright Year	1998
Abstract	The purpose of this paper is to outline various results regarding the computational complexity and the algorithms of nonmonotonic entailment in different coherence‐based approaches. Starting from a (non necessarily consistent) belief base E and a pre‐order on E, we first present different mechanisms for selecting preferred consistent subsets. Then we present different entailment principles in order to manage these multiple subsets. The crossing point of each generation mechanism m and each entailment principle p defines an entailment relation $$ (E, \leqslant )\left\| \sim \right.^{p,m} \Phi $$ which we study from the computational complexity point of view. The results are not very encouraging since the complexity of all these nonmonotonic entailment relations is, in most restricted languages, larger than the complexity of monotonic entailment. So, we decided to extend Binary Decision Diagrams technics, which are well suited to the task of solving NP‐hard logic‐based problems. Both theoretical and experimental results are described along this line in the last sections.
Starting Page	207
Ending Page	236
Page Count	30
File Format	PDF
ISSN	10122443
Journal	Annals of Mathematics and Artificial Intelligence
Volume Number	22
Issue Number	3-4
e-ISSN	15737470
Language	English
Publisher	Kluwer Academic Publishers
Publisher Date	1998-01-01
Publisher Place	Dordrecht
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Computer Science Artificial Intelligence (incl. Robotics) Mathematics Complexity
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Artificial Intelligence

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Nonmonotonic reasoning with multiple belief sets

On a rule-based interpretation of default conditionals

Nonmonotonic consequences in default domain theory

Annotated reasoning

Solving abduction by computing joint explanations : Logic programming formalization, applications to P2P data integration, and complexity results

Anytime clausal reasoning

Detecting and repairing anomalous evolutions in noisy environments : Logic programming formalization and complexity results

Nonmonotonic Reasoning: from Complexity to Algorithms

On geometric and topological reasoning in robotics

Nonmonotonic reasoning: from complexity to algorithms

Similar Documents

Nonmonotonic reasoning with multiple belief sets

On a rule-based interpretation of default conditionals

Nonmonotonic consequences in default domain theory

Annotated reasoning

Solving abduction by computing joint explanations : Logic programming formalization, applications to P2P data integration, and complexity results

Anytime clausal reasoning

Detecting and repairing anomalous evolutions in noisy environments : Logic programming formalization and complexity results

Nonmonotonic Reasoning: from Complexity to Algorithms

On geometric and topological reasoning in robotics

Nonmonotonic reasoning: from complexity to algorithms