{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2549574","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q2549574","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q2549574","kernelVersion":"v1","immutable":true,"modified":"2025-11-22T02:40:35Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q2549574","name":"An admissible and optimal algorithm for searching AND/OR graphs","headline":"An admissible and optimal algorithm for searching AND/OR graphs","description":"scientific article; zbMATH DE number 3361244","url":"https://portal.mardi4nfdi.de/entity/Q2549574","datePublished":"1971-00-00","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q1787138"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q72340"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.1016/0004-3702(71)90006-3","url":"https://doi.org/10.1016/0004-3702(71)90006-3"},"sameAs":["https://doi.org/10.1016/0004-3702(71)90006-3"],"citation":[{"@id":"https://portal.mardi4nfdi.de/entity/Q5610102"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5542557"},{"@id":"https://portal.mardi4nfdi.de/entity/Q2549243"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5507983"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5721424"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5558261"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5563376"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5720484"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5559273"},{"@id":"https://portal.mardi4nfdi.de/entity/Q5630563"}]},"provenance":{"prov:generatedAtTime":"2025-11-22T02:40:35Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}