{"id":"https://openalex.org/W1522557247","doi":"https://doi.org/10.1007/3-540-46135-3_71","title":"A Linear Programming Based Satisfiability Solver Using a New Horn-Driven Search Tree Design","display_name":"A Linear Programming Based Satisfiability Solver Using a New Horn-Driven Search Tree Design","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1522557247","doi":"https://doi.org/10.1007/3-540-46135-3_71","mag":"1522557247"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-46135-3_71","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-46135-3_71","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":"book-chapter","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/A5006121874","display_name":"Linda van Norden","orcid":null},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Linda van Norden","raw_affiliation_strings":["Faculty of Information Technology and Systems, Technical University Delft, Mekelweg 4 2628 CD Delft, P.O. Box 5031, 2600 GA, Delft, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology and Systems, Technical University Delft, Mekelweg 4 2628 CD Delft, P.O. Box 5031, 2600 GA, Delft, The Netherlands","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084566377","display_name":"Hans van Maaren","orcid":null},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Hans van Maaren","raw_affiliation_strings":["Faculty of Information Technology and Systems, Technical University Delft, Mekelweg 4 2628 CD Delft, P.O. Box 5031, 2600 GA, Delft, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology and Systems, Technical University Delft, Mekelweg 4 2628 CD Delft, P.O. Box 5031, 2600 GA, Delft, The Netherlands","institution_ids":["https://openalex.org/I98358874"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12246889,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"775","last_page":"776"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9585000276565552,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9580000042915344,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.7549341917037964},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.674079179763794},{"id":"https://openalex.org/keywords/optimal-binary-search-tree","display_name":"Optimal binary search tree","score":0.5842325091362},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5807790756225586},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.568845272064209},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5082425475120544},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4552549123764038},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4375711679458618},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.42446768283843994},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4205540418624878},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.41458749771118164},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3852687478065491},{"id":"https://openalex.org/keywords/interval-tree","display_name":"Interval tree","score":0.3131883442401886},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2716081440448761},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24042156338691711},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.08547243475914001}],"concepts":[{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.7549341917037964},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.674079179763794},{"id":"https://openalex.org/C27628562","wikidata":"https://www.wikidata.org/wiki/Q17154715","display_name":"Optimal binary search tree","level":5,"score":0.5842325091362},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5807790756225586},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.568845272064209},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5082425475120544},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4552549123764038},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4375711679458618},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.42446768283843994},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4205540418624878},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.41458749771118164},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3852687478065491},{"id":"https://openalex.org/C84927040","wikidata":"https://www.wikidata.org/wiki/Q6057306","display_name":"Interval tree","level":4,"score":0.3131883442401886},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2716081440448761},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24042156338691711},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.08547243475914001},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-46135-3_71","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-46135-3_71","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1505171486","https://openalex.org/W1542895643","https://openalex.org/W4239500750"],"related_works":["https://openalex.org/W2022598760","https://openalex.org/W2949895650","https://openalex.org/W2061004850","https://openalex.org/W2072157347","https://openalex.org/W4292564608","https://openalex.org/W2361906991","https://openalex.org/W1624114741","https://openalex.org/W2280371997","https://openalex.org/W2044936698","https://openalex.org/W3109340025"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}