How to reason defeasibly (Q1199924)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	How to reason defeasibly	scientific article

Statements

scholarly article

0 references

How to reason defeasibly (English)

0 references

zbMATH Open document ID

0 references

10.1016/0004-3702(92)90103-5

0 references

John L. Pollock

0 references

Artificial Intelligence

0 references

publication date

17 January 1993

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

defeasible reasoning

0 references

OSCAR

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/0004-3702(92)90103-5

0 references

0 references

0 references

Formalizing nonmonotonic reasoning systems

0 references

A circumscriptive theorem prover

0 references

Limiting recursion

0 references

A skeptical theory of inheritance in nonmonotonic semantic networks

0 references

The logical foundations of statistical inference

0 references

All I know: A study in autoepistemic logic

0 references

0 references

A general framework for reason maintenance

0 references

Non-monotonic logic. I

0 references

0 references

Interest driven suppositional reasoning

0 references

Trial and error predicates and the solution to a problem of Mostowski

0 references

A logic for default reasoning

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1199924

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1199924&oldid=34097206"