About: Defeasible reasoning

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Defeasible reasoning Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FDefeasible_reasoning

In philosophical logic, defeasible reasoning is a kind of reasoning that is rationally compelling, though not deductively valid. It usually occurs when a rule is given, but there may be specific exceptions to the rule, or subclasses that are subject to a different rule. Defeasibility is found in literatures that are concerned with argument and the process of argument, or heuristic reasoning.

Attributes	Values
rdfs:label	Αναιρέσιμη λογική (el) Defeasible reasoning (en) Raisonnement révisable (fr) Raciocínio revogável (pt) 可废止推理 (zh)
rdfs:comment	Raciocínio revogável (da expressão da língua inglesa defeasible reasoning, também traduzida como raciocínio cancelável e raciocínio anulável) é um tipo de raciocínio que é baseado em razões que são revogáveis, em oposição às razões irrevogáveis da . O raciocínio revogável é um tipo de raciocínio não-demonstrativo, onde o raciocínio não produz uma demonstração total, completa ou final de uma alegação, isto é, onde a falibilidade e a corrigibilidade de uma conclusão são reconhecidas. Outros tipos de raciocínios não-demonstrativos são o , o raciocínio indutivo, o , o e o . O raciocínio revogável também é um tipo de , pois suas conclusões vão além do puro significado das premissas. (pt) 有疏漏性推理是对推理形式的研究，它尽管令人信服，却不如演绎推理那么形式化和严格。它已经在哲学中，和最近在人工智能中讨论过了。其他演绎推理的替代者包括归纳推理和逆推推理。它们在传统上不被术语「有疏漏性推理」所覆盖。 (zh) Η αναιρέσιμη λογική, ή αναιρέσιμος συλλογισμός, είναι ένα σχήμα λογικού συλλογισμού το οποίο δεν αποτελεί με τη στενή (ή «αυστηρή», ή μαθηματική) έννοια αποδεικτικό συμπερασμό. Είναι δηλαδή ένα συλλογιστικό σχήμα παρόμοιο με τον επαγωγικό συλλογισμό και με τον . Σχετίζεται επίσης στενά με την έννοια της αναθεώρησης πεποιθήσεων. Αντίθετα, διαφέρει από τον απαγωγικό συλλογισμό, ο οποίος είναι ο μόνος αυστηρά αποδεικτικός συλλογισμός. Η αναιρέσιμη λογική είναι λοιπόν, πολύ απλά, η λογική που χρησιμοποιείται όταν μια από τις προκείμενες προτάσεις έχει ουσιαστικά τη μορφή: Το Χ είναι Α. (el) In philosophical logic, defeasible reasoning is a kind of reasoning that is rationally compelling, though not deductively valid. It usually occurs when a rule is given, but there may be specific exceptions to the rule, or subclasses that are subject to a different rule. Defeasibility is found in literatures that are concerned with argument and the process of argument, or heuristic reasoning. (en) Le raisonnement révisable est un type de raisonnement qui est basé sur des raisons qui sont révisables, elle est opposé à la raison irévisable de la logique déductive. Le raisonnement révisable est un type particulier de raisonnement non-démonstratif, où le raisonnement ne produit pas une démonstration complète, ou finale d'une déclaration, c'est-à-dire, où la faillibilité et la corrigibilité de conclusion sont reconnus. En d'autres mots, le raisonnement révisable produit une déclaration contingente. D'autre type de raisonnement non-démonstratif existent, dont les suivants: le , raisonnement inductif, raisonnement statistique, raisonnement abductif, ou encore le raisonnement paracohérent. (fr)
dcterms:subject	Logic Knowledge representation Belief revision Epistemology Logic programming Reasoning
Wikipage page ID	2628057 (xsd:integer)
Wikipage revision ID	1092196189 (xsd:integer)
Link from a Wikipage to another Wikipage	Case-based reasoning Ampliative Belief revision Precedent Probabilistic reasoning Robert Nozick Roderick Chisholm Prima facie C.L. Stevenson Non-monotonic reasoning Bertrand Russell Brian Barry David Gauthier Deductive reasoning Logic Anytime algorithm Argument Joseph Raz Rhetoric Decision theory Defeasible logic Defeater Dynamic logic (modal logic) Informal logic Positivist Constructivist epistemology Mathematical logic Epistemology George Boole Gottlob Frege Gouverneur Morris Convention (norm) W.D. Ross Logic Lord Aberdeen Ludwig Wittgenstein Stanford Encyclopedia of Philosophy Stare decisis Statistics Franz Guenthner Friedrich Waismann Planning Truth maintenance system Ceteris paribus H.L.A. Hart Isaac Levi Linguistics Abductive reasoning Abraham Lincoln Alfred North Whitehead Ernest Sosa Ethics Fixed point (mathematics) Nicholas Rescher Paraconsistent Virginia Declaration of Rights Knowledge representation Guillermo Simari Herbert A. Simon James Madison Statistical Aristotle Artificial intelligence Knowledge representation Belief revision Epistemology Logic programming Reasoning Charles Leonard Hamblin Charles Sanders Peirce Joel Feinberg John Adams John L. Pollock John Maynard Keynes Jurisprudence Heuristic Stephen Toulmin Dialectics Philosophy Inductive reasoning Inheritance (computer science) Reasoning

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 45 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software