On strongest necessary and weakest sufficient conditions (Q5941135): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: PDDL / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Relationship Between Abduction and Deduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical notion of conditional independence: properties and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abduction versus closure in causal theories. / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to progress a database / rank
 
Normal rank
Property / cites work
 
Property / cites work: Causal diagrams for empirical research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5822353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: RST Flip-Flop Input Equations / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0004-3702(01)00070-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2104907826 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:24, 30 July 2024

scientific article; zbMATH DE number 1635300
Language Label Description Also known as
English
On strongest necessary and weakest sufficient conditions
scientific article; zbMATH DE number 1635300

    Statements

    On strongest necessary and weakest sufficient conditions (English)
    0 references
    0 references
    20 August 2001
    0 references
    automated reasoning
    0 references
    definability
    0 references
    abduction
    0 references

    Identifiers