Conservative query normalization on parallel circumscription (Q5210781): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-58156-1_21 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1592349378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A circumscriptive theorem prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3830545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4008397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some computational aspects of circumscription / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circumscription - a form of non-monotonic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to compute circumscription / rank
 
Normal rank

Latest revision as of 13:22, 21 July 2024

scientific article; zbMATH DE number 7154554
Language Label Description Also known as
English
Conservative query normalization on parallel circumscription
scientific article; zbMATH DE number 7154554

    Statements

    Conservative query normalization on parallel circumscription (English)
    0 references
    0 references
    21 January 2020
    0 references
    0 references
    0 references