Relaxing non-interference requirements in parallel plans Article Swipe
Miquel Bofill
,
Joan Espasa
,
Mateu Villaret
·
YOU?
·
· 2019
· Open Access
·
· DOI: https://doi.org/10.1093/jigpal/jzz026
YOU?
·
· 2019
· Open Access
·
· DOI: https://doi.org/10.1093/jigpal/jzz026
The aim of being able to reason about quantities, time or space has been the main objective of the many efforts on the integration of propositional planning with extensions to handle different theories. Planning modulo theories (PMTs) are an approximation inspired by satisfiability modulo theories (SMTs) that generalize the integration of arbitrary theories with propositional planning. Parallel plans are crucial to reduce plan lengths and hence the time needed to reach a feasible plan in many approaches. Parallelization of actions relies on the notion of (non-)interference, which is usually determined syntactically at compile time. In this paper we define a semantic notion of interference between actions in PMT. Apart from being strictly stronger than any syntactic notion of interference, we show how semantic interference can be easily and efficiently checked by calling an off-the-shelf SMT solver at compile time, constituting a technique orthogonal to the solving method.
Related Topics
Concepts
Computer science
Modulo
Satisfiability modulo theories
Interference (communication)
Compiler
Satisfiability
Compile time
Solver
Plan (archaeology)
Semantics (computer science)
Theoretical computer science
Programming language
Mathematics
Discrete mathematics
History
Archaeology
Computer network
Channel (broadcasting)
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1093/jigpal/jzz026
- https://academic.oup.com/jigpal/advance-article-pdf/doi/10.1093/jigpal/jzz026/29026058/jzz026.pdf
- OA Status
- hybrid
- Cited By
- 2
- References
- 16
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W2964472589
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2964472589Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1093/jigpal/jzz026Digital Object Identifier
- Title
-
Relaxing non-interference requirements in parallel plansWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2019Year of publication
- Publication date
-
2019-06-25Full publication date if available
- Authors
-
Miquel Bofill, Joan Espasa, Mateu VillaretList of authors in order
- Landing page
-
https://doi.org/10.1093/jigpal/jzz026Publisher landing page
- PDF URL
-
https://academic.oup.com/jigpal/advance-article-pdf/doi/10.1093/jigpal/jzz026/29026058/jzz026.pdfDirect link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
hybridOpen access status per OpenAlex
- OA URL
-
https://academic.oup.com/jigpal/advance-article-pdf/doi/10.1093/jigpal/jzz026/29026058/jzz026.pdfDirect OA link when available
- Concepts
-
Computer science, Modulo, Satisfiability modulo theories, Interference (communication), Compiler, Satisfiability, Compile time, Solver, Plan (archaeology), Semantics (computer science), Theoretical computer science, Programming language, Mathematics, Discrete mathematics, History, Archaeology, Computer network, Channel (broadcasting)Top concepts (fields/topics) attached by OpenAlex
- Cited by
-
2Total citation count in OpenAlex
- Citations by year (recent)
-
2024: 1, 2019: 1Per-year citation counts (last 5 years)
- References (count)
-
16Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2964472589 |
|---|---|
| doi | https://doi.org/10.1093/jigpal/jzz026 |
| ids.doi | https://doi.org/10.1093/jigpal/jzz026 |
| ids.mag | 2964472589 |
| ids.openalex | https://openalex.org/W2964472589 |
| fwci | 0.15361775 |
| type | article |
| title | Relaxing non-interference requirements in parallel plans |
| biblio.issue | 1 |
| biblio.volume | 29 |
| biblio.last_page | 71 |
| biblio.first_page | 45 |
| grants[0].funder | https://openalex.org/F4320310750 |
| grants[0].award_id | MPCUdG2016/055 |
| grants[0].funder_display_name | Universitat de Girona |
| topics[0].id | https://openalex.org/T10906 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9998000264167786 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1702 |
| topics[0].subfield.display_name | Artificial Intelligence |
| topics[0].display_name | AI-based Problem Solving and Planning |
| topics[1].id | https://openalex.org/T11010 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9983999729156494 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1702 |
| topics[1].subfield.display_name | Artificial Intelligence |
| topics[1].display_name | Logic, Reasoning, and Knowledge |
| topics[2].id | https://openalex.org/T10215 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9941999912261963 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1702 |
| topics[2].subfield.display_name | Artificial Intelligence |
| topics[2].display_name | Semantic Web and Ontologies |
| funders[0].id | https://openalex.org/F4320310750 |
| funders[0].ror | https://ror.org/01xdxns91 |
| funders[0].display_name | Universitat de Girona |
| is_xpac | False |
| apc_list.value | 4151 |
| apc_list.currency | USD |
| apc_list.value_usd | 4151 |
| apc_paid.value | 4151 |
| apc_paid.currency | USD |
| apc_paid.value_usd | 4151 |
| concepts[0].id | https://openalex.org/C41008148 |
| concepts[0].level | 0 |
| concepts[0].score | 0.7512506246566772 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[0].display_name | Computer science |
| concepts[1].id | https://openalex.org/C54732982 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6938284039497375 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q1415345 |
| concepts[1].display_name | Modulo |
| concepts[2].id | https://openalex.org/C164155591 |
| concepts[2].level | 2 |
| concepts[2].score | 0.6744633316993713 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q2067766 |
| concepts[2].display_name | Satisfiability modulo theories |
| concepts[3].id | https://openalex.org/C32022120 |
| concepts[3].level | 3 |
| concepts[3].score | 0.61808842420578 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q797225 |
| concepts[3].display_name | Interference (communication) |
| concepts[4].id | https://openalex.org/C169590947 |
| concepts[4].level | 2 |
| concepts[4].score | 0.602271318435669 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q47506 |
| concepts[4].display_name | Compiler |
| concepts[5].id | https://openalex.org/C168773769 |
| concepts[5].level | 2 |
| concepts[5].score | 0.5913469195365906 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q1350299 |
| concepts[5].display_name | Satisfiability |
| concepts[6].id | https://openalex.org/C200833197 |
| concepts[6].level | 3 |
| concepts[6].score | 0.520410418510437 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q333707 |
| concepts[6].display_name | Compile time |
| concepts[7].id | https://openalex.org/C2778770139 |
| concepts[7].level | 2 |
| concepts[7].score | 0.49999380111694336 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q1966904 |
| concepts[7].display_name | Solver |
| concepts[8].id | https://openalex.org/C2776505523 |
| concepts[8].level | 2 |
| concepts[8].score | 0.4780624210834503 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q4785468 |
| concepts[8].display_name | Plan (archaeology) |
| concepts[9].id | https://openalex.org/C184337299 |
| concepts[9].level | 2 |
| concepts[9].score | 0.41830214858055115 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q1437428 |
| concepts[9].display_name | Semantics (computer science) |
| concepts[10].id | https://openalex.org/C80444323 |
| concepts[10].level | 1 |
| concepts[10].score | 0.4111706614494324 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[10].display_name | Theoretical computer science |
| concepts[11].id | https://openalex.org/C199360897 |
| concepts[11].level | 1 |
| concepts[11].score | 0.3074611723423004 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q9143 |
| concepts[11].display_name | Programming language |
| concepts[12].id | https://openalex.org/C33923547 |
| concepts[12].level | 0 |
| concepts[12].score | 0.2112712264060974 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[12].display_name | Mathematics |
| concepts[13].id | https://openalex.org/C118615104 |
| concepts[13].level | 1 |
| concepts[13].score | 0.16692286729812622 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q121416 |
| concepts[13].display_name | Discrete mathematics |
| concepts[14].id | https://openalex.org/C95457728 |
| concepts[14].level | 0 |
| concepts[14].score | 0.0 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q309 |
| concepts[14].display_name | History |
| concepts[15].id | https://openalex.org/C166957645 |
| concepts[15].level | 1 |
| concepts[15].score | 0.0 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q23498 |
| concepts[15].display_name | Archaeology |
| concepts[16].id | https://openalex.org/C31258907 |
| concepts[16].level | 1 |
| concepts[16].score | 0.0 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[16].display_name | Computer network |
| concepts[17].id | https://openalex.org/C127162648 |
| concepts[17].level | 2 |
| concepts[17].score | 0.0 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q16858953 |
| concepts[17].display_name | Channel (broadcasting) |
| keywords[0].id | https://openalex.org/keywords/computer-science |
| keywords[0].score | 0.7512506246566772 |
| keywords[0].display_name | Computer science |
| keywords[1].id | https://openalex.org/keywords/modulo |
| keywords[1].score | 0.6938284039497375 |
| keywords[1].display_name | Modulo |
| keywords[2].id | https://openalex.org/keywords/satisfiability-modulo-theories |
| keywords[2].score | 0.6744633316993713 |
| keywords[2].display_name | Satisfiability modulo theories |
| keywords[3].id | https://openalex.org/keywords/interference |
| keywords[3].score | 0.61808842420578 |
| keywords[3].display_name | Interference (communication) |
| keywords[4].id | https://openalex.org/keywords/compiler |
| keywords[4].score | 0.602271318435669 |
| keywords[4].display_name | Compiler |
| keywords[5].id | https://openalex.org/keywords/satisfiability |
| keywords[5].score | 0.5913469195365906 |
| keywords[5].display_name | Satisfiability |
| keywords[6].id | https://openalex.org/keywords/compile-time |
| keywords[6].score | 0.520410418510437 |
| keywords[6].display_name | Compile time |
| keywords[7].id | https://openalex.org/keywords/solver |
| keywords[7].score | 0.49999380111694336 |
| keywords[7].display_name | Solver |
| keywords[8].id | https://openalex.org/keywords/plan |
| keywords[8].score | 0.4780624210834503 |
| keywords[8].display_name | Plan (archaeology) |
| keywords[9].id | https://openalex.org/keywords/semantics |
| keywords[9].score | 0.41830214858055115 |
| keywords[9].display_name | Semantics (computer science) |
| keywords[10].id | https://openalex.org/keywords/theoretical-computer-science |
| keywords[10].score | 0.4111706614494324 |
| keywords[10].display_name | Theoretical computer science |
| keywords[11].id | https://openalex.org/keywords/programming-language |
| keywords[11].score | 0.3074611723423004 |
| keywords[11].display_name | Programming language |
| keywords[12].id | https://openalex.org/keywords/mathematics |
| keywords[12].score | 0.2112712264060974 |
| keywords[12].display_name | Mathematics |
| keywords[13].id | https://openalex.org/keywords/discrete-mathematics |
| keywords[13].score | 0.16692286729812622 |
| keywords[13].display_name | Discrete mathematics |
| language | en |
| locations[0].id | doi:10.1093/jigpal/jzz026 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S2734381524 |
| locations[0].source.issn | 1367-0751, 1368-9894 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | 1367-0751 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Logic Journal of IGPL |
| locations[0].source.host_organization | https://openalex.org/P4310311648 |
| locations[0].source.host_organization_name | Oxford University Press |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310311648 |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://academic.oup.com/jigpal/advance-article-pdf/doi/10.1093/jigpal/jzz026/29026058/jzz026.pdf |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Logic Journal of the IGPL |
| locations[0].landing_page_url | https://doi.org/10.1093/jigpal/jzz026 |
| locations[1].id | pmh:oai:research-repository.st-andrews.ac.uk:10023/18671 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400230 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | False |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | St Andrews Research Repository (St Andrews Research Repository) |
| locations[1].source.host_organization | https://openalex.org/I16835326 |
| locations[1].source.host_organization_name | University of St Andrews |
| locations[1].source.host_organization_lineage | https://openalex.org/I16835326 |
| locations[1].license | cc-by |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | Journal article |
| locations[1].license_id | https://openalex.org/licenses/cc-by |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | https://hdl.handle.net/10023/18671 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5038978960 |
| authorships[0].author.orcid | https://orcid.org/0000-0003-0308-9867 |
| authorships[0].author.display_name | Miquel Bofill |
| authorships[0].countries | ES |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I251424209 |
| authorships[0].affiliations[0].raw_affiliation_string | Departament d’Informàtica, Matemàtica Aplicada i Estadística Universitat de Girona, E-17003 Girona, Spain |
| authorships[0].institutions[0].id | https://openalex.org/I251424209 |
| authorships[0].institutions[0].ror | https://ror.org/01xdxns91 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I251424209 |
| authorships[0].institutions[0].country_code | ES |
| authorships[0].institutions[0].display_name | Universitat de Girona |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Miquel Bofill |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Departament d’Informàtica, Matemàtica Aplicada i Estadística Universitat de Girona, E-17003 Girona, Spain |
| authorships[1].author.id | https://openalex.org/A5053293125 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-9021-3047 |
| authorships[1].author.display_name | Joan Espasa |
| authorships[1].countries | GB |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I16835326 |
| authorships[1].affiliations[0].raw_affiliation_string | School of Computer Science, University of St Andrews, St Andrews KY16 9SX, UK |
| authorships[1].institutions[0].id | https://openalex.org/I16835326 |
| authorships[1].institutions[0].ror | https://ror.org/02wn5qz54 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I16835326 |
| authorships[1].institutions[0].country_code | GB |
| authorships[1].institutions[0].display_name | University of St Andrews |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Joan Espasa |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | School of Computer Science, University of St Andrews, St Andrews KY16 9SX, UK |
| authorships[2].author.id | https://openalex.org/A5021854785 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-8066-3458 |
| authorships[2].author.display_name | Mateu Villaret |
| authorships[2].countries | ES |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I251424209 |
| authorships[2].affiliations[0].raw_affiliation_string | Departament d’Informàtica, Matemàtica Aplicada i Estadística Universitat de Girona, E-17003 Girona, Spain |
| authorships[2].institutions[0].id | https://openalex.org/I251424209 |
| authorships[2].institutions[0].ror | https://ror.org/01xdxns91 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I251424209 |
| authorships[2].institutions[0].country_code | ES |
| authorships[2].institutions[0].display_name | Universitat de Girona |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | Mateu Villaret |
| authorships[2].is_corresponding | True |
| authorships[2].raw_affiliation_strings | Departament d’Informàtica, Matemàtica Aplicada i Estadística Universitat de Girona, E-17003 Girona, Spain |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://academic.oup.com/jigpal/advance-article-pdf/doi/10.1093/jigpal/jzz026/29026058/jzz026.pdf |
| open_access.oa_status | hybrid |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Relaxing non-interference requirements in parallel plans |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10906 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9998000264167786 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1702 |
| primary_topic.subfield.display_name | Artificial Intelligence |
| primary_topic.display_name | AI-based Problem Solving and Planning |
| related_works | https://openalex.org/W2371266106, https://openalex.org/W2117382851, https://openalex.org/W3006505070, https://openalex.org/W2382449560, https://openalex.org/W2767298477, https://openalex.org/W2110432562, https://openalex.org/W2578463151, https://openalex.org/W4379142300, https://openalex.org/W2025344, https://openalex.org/W2117864619 |
| cited_by_count | 2 |
| counts_by_year[0].year | 2024 |
| counts_by_year[0].cited_by_count | 1 |
| counts_by_year[1].year | 2019 |
| counts_by_year[1].cited_by_count | 1 |
| locations_count | 2 |
| best_oa_location.id | doi:10.1093/jigpal/jzz026 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S2734381524 |
| best_oa_location.source.issn | 1367-0751, 1368-9894 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | 1367-0751 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | Logic Journal of IGPL |
| best_oa_location.source.host_organization | https://openalex.org/P4310311648 |
| best_oa_location.source.host_organization_name | Oxford University Press |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310311648 |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://academic.oup.com/jigpal/advance-article-pdf/doi/10.1093/jigpal/jzz026/29026058/jzz026.pdf |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Logic Journal of the IGPL |
| best_oa_location.landing_page_url | https://doi.org/10.1093/jigpal/jzz026 |
| primary_location.id | doi:10.1093/jigpal/jzz026 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S2734381524 |
| primary_location.source.issn | 1367-0751, 1368-9894 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | 1367-0751 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Logic Journal of IGPL |
| primary_location.source.host_organization | https://openalex.org/P4310311648 |
| primary_location.source.host_organization_name | Oxford University Press |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310311648 |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://academic.oup.com/jigpal/advance-article-pdf/doi/10.1093/jigpal/jzz026/29026058/jzz026.pdf |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Logic Journal of the IGPL |
| primary_location.landing_page_url | https://doi.org/10.1093/jigpal/jzz026 |
| publication_date | 2019-06-25 |
| publication_year | 2019 |
| referenced_works | https://openalex.org/W6732025253, https://openalex.org/W2566681915, https://openalex.org/W1663140555, https://openalex.org/W6603841182, https://openalex.org/W2119709400, https://openalex.org/W2074583297, https://openalex.org/W1585557683, https://openalex.org/W6681458972, https://openalex.org/W6633206498, https://openalex.org/W2065307084, https://openalex.org/W1973898358, https://openalex.org/W2083920669, https://openalex.org/W2095760119, https://openalex.org/W1555936869, https://openalex.org/W2577639219, https://openalex.org/W4206807714 |
| referenced_works_count | 16 |
| abstract_inverted_index.a | 72, 100, 141 |
| abstract_inverted_index.In | 95 |
| abstract_inverted_index.an | 39, 133 |
| abstract_inverted_index.at | 92, 137 |
| abstract_inverted_index.be | 126 |
| abstract_inverted_index.by | 42, 131 |
| abstract_inverted_index.in | 75, 107 |
| abstract_inverted_index.is | 88 |
| abstract_inverted_index.of | 3, 18, 25, 51, 79, 85, 103, 118 |
| abstract_inverted_index.on | 22, 82 |
| abstract_inverted_index.or | 11 |
| abstract_inverted_index.to | 6, 30, 61, 70, 144 |
| abstract_inverted_index.we | 98, 120 |
| abstract_inverted_index.SMT | 135 |
| abstract_inverted_index.The | 1 |
| abstract_inverted_index.aim | 2 |
| abstract_inverted_index.and | 65, 128 |
| abstract_inverted_index.any | 115 |
| abstract_inverted_index.are | 38, 59 |
| abstract_inverted_index.can | 125 |
| abstract_inverted_index.has | 13 |
| abstract_inverted_index.how | 122 |
| abstract_inverted_index.the | 15, 19, 23, 49, 67, 83, 145 |
| abstract_inverted_index.PMT. | 108 |
| abstract_inverted_index.able | 5 |
| abstract_inverted_index.been | 14 |
| abstract_inverted_index.from | 110 |
| abstract_inverted_index.main | 16 |
| abstract_inverted_index.many | 20, 76 |
| abstract_inverted_index.plan | 63, 74 |
| abstract_inverted_index.show | 121 |
| abstract_inverted_index.than | 114 |
| abstract_inverted_index.that | 47 |
| abstract_inverted_index.this | 96 |
| abstract_inverted_index.time | 10, 68 |
| abstract_inverted_index.with | 28, 54 |
| abstract_inverted_index.Apart | 109 |
| abstract_inverted_index.about | 8 |
| abstract_inverted_index.being | 4, 111 |
| abstract_inverted_index.hence | 66 |
| abstract_inverted_index.paper | 97 |
| abstract_inverted_index.plans | 58 |
| abstract_inverted_index.reach | 71 |
| abstract_inverted_index.space | 12 |
| abstract_inverted_index.time, | 139 |
| abstract_inverted_index.time. | 94 |
| abstract_inverted_index.which | 87 |
| abstract_inverted_index.(PMTs) | 37 |
| abstract_inverted_index.(SMTs) | 46 |
| abstract_inverted_index.define | 99 |
| abstract_inverted_index.easily | 127 |
| abstract_inverted_index.handle | 31 |
| abstract_inverted_index.modulo | 35, 44 |
| abstract_inverted_index.needed | 69 |
| abstract_inverted_index.notion | 84, 102, 117 |
| abstract_inverted_index.reason | 7 |
| abstract_inverted_index.reduce | 62 |
| abstract_inverted_index.relies | 81 |
| abstract_inverted_index.solver | 136 |
| abstract_inverted_index.actions | 80, 106 |
| abstract_inverted_index.between | 105 |
| abstract_inverted_index.calling | 132 |
| abstract_inverted_index.checked | 130 |
| abstract_inverted_index.compile | 93, 138 |
| abstract_inverted_index.crucial | 60 |
| abstract_inverted_index.efforts | 21 |
| abstract_inverted_index.lengths | 64 |
| abstract_inverted_index.method. | 147 |
| abstract_inverted_index.solving | 146 |
| abstract_inverted_index.usually | 89 |
| abstract_inverted_index.Abstract | 0 |
| abstract_inverted_index.Parallel | 57 |
| abstract_inverted_index.Planning | 34 |
| abstract_inverted_index.feasible | 73 |
| abstract_inverted_index.inspired | 41 |
| abstract_inverted_index.planning | 27 |
| abstract_inverted_index.semantic | 101, 123 |
| abstract_inverted_index.strictly | 112 |
| abstract_inverted_index.stronger | 113 |
| abstract_inverted_index.theories | 36, 45, 53 |
| abstract_inverted_index.arbitrary | 52 |
| abstract_inverted_index.different | 32 |
| abstract_inverted_index.objective | 17 |
| abstract_inverted_index.planning. | 56 |
| abstract_inverted_index.syntactic | 116 |
| abstract_inverted_index.technique | 142 |
| abstract_inverted_index.theories. | 33 |
| abstract_inverted_index.determined | 90 |
| abstract_inverted_index.extensions | 29 |
| abstract_inverted_index.generalize | 48 |
| abstract_inverted_index.orthogonal | 143 |
| abstract_inverted_index.approaches. | 77 |
| abstract_inverted_index.efficiently | 129 |
| abstract_inverted_index.integration | 24, 50 |
| abstract_inverted_index.quantities, | 9 |
| abstract_inverted_index.constituting | 140 |
| abstract_inverted_index.interference | 104, 124 |
| abstract_inverted_index.approximation | 40 |
| abstract_inverted_index.interference, | 119 |
| abstract_inverted_index.off-the-shelf | 134 |
| abstract_inverted_index.propositional | 26, 55 |
| abstract_inverted_index.syntactically | 91 |
| abstract_inverted_index.satisfiability | 43 |
| abstract_inverted_index.Parallelization | 78 |
| abstract_inverted_index.(non-)interference, | 86 |
| cited_by_percentile_year.max | 94 |
| cited_by_percentile_year.min | 90 |
| corresponding_author_ids | https://openalex.org/A5021854785 |
| countries_distinct_count | 2 |
| institutions_distinct_count | 3 |
| corresponding_institution_ids | https://openalex.org/I251424209 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/11 |
| sustainable_development_goals[0].score | 0.4399999976158142 |
| sustainable_development_goals[0].display_name | Sustainable cities and communities |
| citation_normalized_percentile.value | 0.56512986 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |