{"id":"https://openalex.org/W2148568439","doi":"https://doi.org/10.1007/3-540-36078-6_10","title":"Directed Automated Theorem Proving","display_name":"Directed Automated Theorem Proving","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2148568439","doi":"https://doi.org/10.1007/3-540-36078-6_10","mag":"2148568439"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-36078-6_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-36078-6_10","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058729606","display_name":"Stefan Edelkamp","orcid":"https://orcid.org/0000-0001-8435-5025"},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Stefan Edelkamp","raw_affiliation_strings":["Institut f\u00fcr Informatik Georges-K\u00f6hler-Allee, Geb. 51, Albert-Ludwigs-Universit\u00e4t Freiburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik Georges-K\u00f6hler-Allee, Geb. 51, Albert-Ludwigs-Universit\u00e4t Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077385305","display_name":"Peter Leven","orcid":null},"institutions":[{"id":"https://openalex.org/I161046081","display_name":"University of Freiburg","ror":"https://ror.org/0245cg223","country_code":"DE","type":"education","lineage":["https://openalex.org/I161046081"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Peter Leven","raw_affiliation_strings":["Institut f\u00fcr Informatik Georges-K\u00f6hler-Allee, Geb. 51, Albert-Ludwigs-Universit\u00e4t Freiburg, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Informatik Georges-K\u00f6hler-Allee, Geb. 51, Albert-Ludwigs-Universit\u00e4t Freiburg, Germany","institution_ids":["https://openalex.org/I161046081"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I161046081"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.2808,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.54444139,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"145","last_page":"159"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9961000084877014,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.864251971244812},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7775826454162598},{"id":"https://openalex.org/keywords/automated-theorem-proving","display_name":"Automated theorem proving","score":0.7666537761688232},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5606297254562378},{"id":"https://openalex.org/keywords/automated-proof-checking","display_name":"Automated proof checking","score":0.4984729290008545},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4817800223827362},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.442607581615448},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4394806921482086},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4334104359149933},{"id":"https://openalex.org/keywords/rule-of-inference","display_name":"Rule of inference","score":0.42950087785720825},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.4275517165660858},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4197236895561218},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.34480294585227966},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1699678897857666},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.09052151441574097}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.864251971244812},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7775826454162598},{"id":"https://openalex.org/C206880738","wikidata":"https://www.wikidata.org/wiki/Q431667","display_name":"Automated theorem proving","level":2,"score":0.7666537761688232},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5606297254562378},{"id":"https://openalex.org/C13766981","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Automated proof checking","level":3,"score":0.4984729290008545},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4817800223827362},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.442607581615448},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4394806921482086},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4334104359149933},{"id":"https://openalex.org/C3746660","wikidata":"https://www.wikidata.org/wiki/Q1068763","display_name":"Rule of inference","level":2,"score":0.42950087785720825},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.4275517165660858},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4197236895561218},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.34480294585227966},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1699678897857666},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.09052151441574097}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-36078-6_10","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-36078-6_10","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W50575629","https://openalex.org/W1509439117","https://openalex.org/W1545688112","https://openalex.org/W1546159376","https://openalex.org/W1560253649","https://openalex.org/W1565996669","https://openalex.org/W1572955246","https://openalex.org/W1575990843","https://openalex.org/W1584811656","https://openalex.org/W1588666994","https://openalex.org/W1659048632","https://openalex.org/W1664582451","https://openalex.org/W2009833344","https://openalex.org/W2011992362","https://openalex.org/W2012170877","https://openalex.org/W2056241458","https://openalex.org/W2084224084","https://openalex.org/W2084894656","https://openalex.org/W2085838366","https://openalex.org/W2095760119","https://openalex.org/W2105045857","https://openalex.org/W2106192381","https://openalex.org/W2136598300","https://openalex.org/W2141088850","https://openalex.org/W2163727243","https://openalex.org/W2169528473","https://openalex.org/W2913459036","https://openalex.org/W4250846042","https://openalex.org/W6630610174","https://openalex.org/W6634479986","https://openalex.org/W6684644128"],"related_works":["https://openalex.org/W3209137076","https://openalex.org/W4223969905","https://openalex.org/W2374560440","https://openalex.org/W1490490684","https://openalex.org/W2887026015","https://openalex.org/W2361442013","https://openalex.org/W2373384475","https://openalex.org/W2990531685","https://openalex.org/W2148568439","https://openalex.org/W1527829691"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}