Extending Well-Founded Semantics with Clark’s Completion for Disjunctive Logic Programs Article Swipe
YOU?
·
· 2018
· Open Access
·
· DOI: https://doi.org/10.1155/2018/4157030
In this paper, we introduce new semantics (that we call D3-WFS-DCOMP) and compare it with the stable semantics (STABLE). For normal programs, this semantics is based on suitable integration of the well-founded semantics (WFS) and the Clark’s completion. D3-WFS-DCOM has the following appealing properties: First, it agrees with STABLE in the sense that it never defines a nonminimal model or a nonminimal supported model. Second, for normal programs it extends WFS. Third, every stable model of a disjunctive programis a D3-WFS-DCOM model of. Fourth, it is constructed using transformation rules accepted by STABLE. We also introduce second semantics that we call D2-WFS-DCOMP. We show that D2-WFS-DCOMP is equivalent to D3-WFS-DCOMP for normal programs but this is not the case for disjunctive programs. We also introduce third new semantics that supports the use of implicit disjunctions. We illustrate how these semantics can be extended to programs including explicit negation, default negation in the head of a clause, and aoperator, which is a generalization of the aggregation operator setof over arbitrary complete lattices.
Related Topics
- Type
- article
- Language
- en
- Landing Page
- http://doi.org/10.1155/2018/4157030
- http://downloads.hindawi.com/journals/sp/2018/4157030.pdf
- OA Status
- hybrid
- Cited By
- 2
- References
- 21
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W2790167108
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2790167108Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1155/2018/4157030Digital Object Identifier
- Title
-
Extending Well-Founded Semantics with Clark’s Completion for Disjunctive Logic ProgramsWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2018Year of publication
- Publication date
-
2018-01-01Full publication date if available
- Authors
-
Juan Carlos Nieves, Mauricio OsorioList of authors in order
- Landing page
-
https://doi.org/10.1155/2018/4157030Publisher landing page
- PDF URL
-
https://downloads.hindawi.com/journals/sp/2018/4157030.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://downloads.hindawi.com/journals/sp/2018/4157030.pdfDirect OA link when available
- Concepts
-
Negation, Semantics (computer science), Computer science, Algorithm, Artificial intelligence, Stable model semantics, Programming language, Natural language processing, Operational semanticsTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
2Total citation count in OpenAlex
- Citations by year (recent)
-
2023: 2Per-year citation counts (last 5 years)
- References (count)
-
21Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2790167108 |
|---|---|
| doi | https://doi.org/10.1155/2018/4157030 |
| ids.doi | https://doi.org/10.1155/2018/4157030 |
| ids.mag | 2790167108 |
| ids.openalex | https://openalex.org/W2790167108 |
| fwci | 0.0 |
| type | article |
| title | Extending Well-Founded Semantics with Clark’s Completion for Disjunctive Logic Programs |
| biblio.issue | |
| biblio.volume | 2018 |
| biblio.last_page | 10 |
| biblio.first_page | 1 |
| topics[0].id | https://openalex.org/T11010 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9998999834060669 |
| 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 | Logic, Reasoning, and Knowledge |
| topics[1].id | https://openalex.org/T10126 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9988999962806702 |
| 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, programming, and type systems |
| topics[2].id | https://openalex.org/T10456 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9984999895095825 |
| 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 | Multi-Agent Systems and Negotiation |
| is_xpac | False |
| apc_list.value | 1800 |
| apc_list.currency | USD |
| apc_list.value_usd | 1800 |
| apc_paid.value | 1800 |
| apc_paid.currency | USD |
| apc_paid.value_usd | 1800 |
| concepts[0].id | https://openalex.org/C2185349 |
| concepts[0].level | 2 |
| concepts[0].score | 0.6681953072547913 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q190558 |
| concepts[0].display_name | Negation |
| concepts[1].id | https://openalex.org/C184337299 |
| concepts[1].level | 2 |
| concepts[1].score | 0.6171136498451233 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q1437428 |
| concepts[1].display_name | Semantics (computer science) |
| concepts[2].id | https://openalex.org/C41008148 |
| concepts[2].level | 0 |
| concepts[2].score | 0.60735023021698 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[2].display_name | Computer science |
| concepts[3].id | https://openalex.org/C11413529 |
| concepts[3].level | 1 |
| concepts[3].score | 0.6033549904823303 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[3].display_name | Algorithm |
| concepts[4].id | https://openalex.org/C154945302 |
| concepts[4].level | 1 |
| concepts[4].score | 0.45168691873550415 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[4].display_name | Artificial intelligence |
| concepts[5].id | https://openalex.org/C127001435 |
| concepts[5].level | 4 |
| concepts[5].score | 0.43174049258232117 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q7595770 |
| concepts[5].display_name | Stable model semantics |
| concepts[6].id | https://openalex.org/C199360897 |
| concepts[6].level | 1 |
| concepts[6].score | 0.40151822566986084 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q9143 |
| concepts[6].display_name | Programming language |
| concepts[7].id | https://openalex.org/C204321447 |
| concepts[7].level | 1 |
| concepts[7].score | 0.3551884591579437 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q30642 |
| concepts[7].display_name | Natural language processing |
| concepts[8].id | https://openalex.org/C156325763 |
| concepts[8].level | 3 |
| concepts[8].score | 0.353016197681427 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q1930895 |
| concepts[8].display_name | Operational semantics |
| keywords[0].id | https://openalex.org/keywords/negation |
| keywords[0].score | 0.6681953072547913 |
| keywords[0].display_name | Negation |
| keywords[1].id | https://openalex.org/keywords/semantics |
| keywords[1].score | 0.6171136498451233 |
| keywords[1].display_name | Semantics (computer science) |
| keywords[2].id | https://openalex.org/keywords/computer-science |
| keywords[2].score | 0.60735023021698 |
| keywords[2].display_name | Computer science |
| keywords[3].id | https://openalex.org/keywords/algorithm |
| keywords[3].score | 0.6033549904823303 |
| keywords[3].display_name | Algorithm |
| keywords[4].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[4].score | 0.45168691873550415 |
| keywords[4].display_name | Artificial intelligence |
| keywords[5].id | https://openalex.org/keywords/stable-model-semantics |
| keywords[5].score | 0.43174049258232117 |
| keywords[5].display_name | Stable model semantics |
| keywords[6].id | https://openalex.org/keywords/programming-language |
| keywords[6].score | 0.40151822566986084 |
| keywords[6].display_name | Programming language |
| keywords[7].id | https://openalex.org/keywords/natural-language-processing |
| keywords[7].score | 0.3551884591579437 |
| keywords[7].display_name | Natural language processing |
| keywords[8].id | https://openalex.org/keywords/operational-semantics |
| keywords[8].score | 0.353016197681427 |
| keywords[8].display_name | Operational semantics |
| language | en |
| locations[0].id | doi:10.1155/2018/4157030 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S166774750 |
| locations[0].source.issn | 1058-9244, 1875-919X |
| locations[0].source.type | journal |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | 1058-9244 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Scientific Programming |
| locations[0].source.host_organization | https://openalex.org/P4310319869 |
| locations[0].source.host_organization_name | Hindawi Publishing Corporation |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310319869 |
| locations[0].source.host_organization_lineage_names | Hindawi Publishing Corporation |
| locations[0].license | cc-by |
| locations[0].pdf_url | http://downloads.hindawi.com/journals/sp/2018/4157030.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 | Scientific Programming |
| locations[0].landing_page_url | http://doi.org/10.1155/2018/4157030 |
| locations[1].id | pmh:oai:DiVA.org:umu-146463 |
| locations[1].is_oa | True |
| locations[1].source.id | https://openalex.org/S4306400013 |
| 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 | Publications (Konstfack University of Arts, Crafts, and Design) |
| locations[1].source.host_organization | https://openalex.org/I218177685 |
| locations[1].source.host_organization_name | University College of Arts Crafts and Design |
| locations[1].source.host_organization_lineage | https://openalex.org/I218177685 |
| locations[1].license | other-oa |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | Article in journal |
| locations[1].license_id | https://openalex.org/licenses/other-oa |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | |
| locations[1].landing_page_url | http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-146463 |
| locations[2].id | pmh:oai:doaj.org/article:51a78fde09e8430a860b6f2e3261d658 |
| locations[2].is_oa | True |
| locations[2].source.id | https://openalex.org/S4306401280 |
| locations[2].source.issn | |
| locations[2].source.type | repository |
| locations[2].source.is_oa | False |
| locations[2].source.issn_l | |
| locations[2].source.is_core | False |
| locations[2].source.is_in_doaj | False |
| locations[2].source.display_name | DOAJ (DOAJ: Directory of Open Access Journals) |
| locations[2].source.host_organization | |
| locations[2].source.host_organization_name | |
| locations[2].license | cc-by-sa |
| locations[2].pdf_url | |
| locations[2].version | submittedVersion |
| locations[2].raw_type | article |
| locations[2].license_id | https://openalex.org/licenses/cc-by-sa |
| locations[2].is_accepted | False |
| locations[2].is_published | False |
| locations[2].raw_source_name | Scientific Programming, Vol 2018 (2018) |
| locations[2].landing_page_url | https://doaj.org/article/51a78fde09e8430a860b6f2e3261d658 |
| locations[3].id | pmh:oai:hindawi.com:10.1155/2018/4157030 |
| locations[3].is_oa | True |
| locations[3].source.id | https://openalex.org/S4306400340 |
| locations[3].source.issn | |
| locations[3].source.type | repository |
| locations[3].source.is_oa | False |
| locations[3].source.issn_l | |
| locations[3].source.is_core | False |
| locations[3].source.is_in_doaj | False |
| locations[3].source.display_name | Hindawi Journal of Chemistry (Hindawi) |
| locations[3].source.host_organization | https://openalex.org/I4210126990 |
| locations[3].source.host_organization_name | Hindawi (United Kingdom) |
| locations[3].source.host_organization_lineage | https://openalex.org/I4210126990 |
| locations[3].license | cc-by |
| locations[3].pdf_url | |
| locations[3].version | submittedVersion |
| locations[3].raw_type | Research Article |
| locations[3].license_id | https://openalex.org/licenses/cc-by |
| locations[3].is_accepted | False |
| locations[3].is_published | False |
| locations[3].raw_source_name | |
| locations[3].landing_page_url | https://doi.org/10.1155/2018/4157030 |
| indexed_in | crossref, doaj |
| authorships[0].author.id | https://openalex.org/A5045363362 |
| authorships[0].author.orcid | https://orcid.org/0000-0003-4072-8795 |
| authorships[0].author.display_name | Juan Carlos Nieves |
| authorships[0].countries | SE |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I90267481 |
| authorships[0].affiliations[0].raw_affiliation_string | Department of Computing Science, Umeå University, 901 87 Umeå, Sweden |
| authorships[0].institutions[0].id | https://openalex.org/I90267481 |
| authorships[0].institutions[0].ror | https://ror.org/05kb8h459 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I90267481 |
| authorships[0].institutions[0].country_code | SE |
| authorships[0].institutions[0].display_name | Umeå University |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Juan Carlos Nieves |
| authorships[0].is_corresponding | True |
| authorships[0].raw_affiliation_strings | Department of Computing Science, Umeå University, 901 87 Umeå, Sweden |
| authorships[1].author.id | https://openalex.org/A5103731655 |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | Mauricio Osorio |
| authorships[1].countries | MX |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I69181431 |
| authorships[1].affiliations[0].raw_affiliation_string | Departamento de Actuaría, Física y Matemáticas, Universidad de las Américas Puebla, Sta. Catarina Mártir, 72820 Cholula, PUE, Mexico |
| authorships[1].institutions[0].id | https://openalex.org/I69181431 |
| authorships[1].institutions[0].ror | https://ror.org/01s1km724 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I69181431 |
| authorships[1].institutions[0].country_code | MX |
| authorships[1].institutions[0].display_name | Universidad de las Américas Puebla |
| authorships[1].author_position | last |
| authorships[1].raw_author_name | Mauricio Osorio |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Departamento de Actuaría, Física y Matemáticas, Universidad de las Américas Puebla, Sta. Catarina Mártir, 72820 Cholula, PUE, Mexico |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | http://downloads.hindawi.com/journals/sp/2018/4157030.pdf |
| open_access.oa_status | hybrid |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Extending Well-Founded Semantics with Clark’s Completion for Disjunctive Logic Programs |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T11010 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9998999834060669 |
| 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 | Logic, Reasoning, and Knowledge |
| related_works | https://openalex.org/W2160196023, https://openalex.org/W1487966966, https://openalex.org/W1482532369, https://openalex.org/W2245685274, https://openalex.org/W2188386601, https://openalex.org/W3042312155, https://openalex.org/W2788308474, https://openalex.org/W2100934637, https://openalex.org/W1572426677, https://openalex.org/W3021003119 |
| cited_by_count | 2 |
| counts_by_year[0].year | 2023 |
| counts_by_year[0].cited_by_count | 2 |
| locations_count | 4 |
| best_oa_location.id | doi:10.1155/2018/4157030 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S166774750 |
| best_oa_location.source.issn | 1058-9244, 1875-919X |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | 1058-9244 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | Scientific Programming |
| best_oa_location.source.host_organization | https://openalex.org/P4310319869 |
| best_oa_location.source.host_organization_name | Hindawi Publishing Corporation |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310319869 |
| best_oa_location.source.host_organization_lineage_names | Hindawi Publishing Corporation |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | http://downloads.hindawi.com/journals/sp/2018/4157030.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 | Scientific Programming |
| best_oa_location.landing_page_url | http://doi.org/10.1155/2018/4157030 |
| primary_location.id | doi:10.1155/2018/4157030 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S166774750 |
| primary_location.source.issn | 1058-9244, 1875-919X |
| primary_location.source.type | journal |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | 1058-9244 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Scientific Programming |
| primary_location.source.host_organization | https://openalex.org/P4310319869 |
| primary_location.source.host_organization_name | Hindawi Publishing Corporation |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310319869 |
| primary_location.source.host_organization_lineage_names | Hindawi Publishing Corporation |
| primary_location.license | cc-by |
| primary_location.pdf_url | http://downloads.hindawi.com/journals/sp/2018/4157030.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 | Scientific Programming |
| primary_location.landing_page_url | http://doi.org/10.1155/2018/4157030 |
| publication_date | 2018-01-01 |
| publication_year | 2018 |
| referenced_works | https://openalex.org/W1606891084, https://openalex.org/W4231492400, https://openalex.org/W2050655425, https://openalex.org/W2024943265, https://openalex.org/W2093089155, https://openalex.org/W2028582842, https://openalex.org/W1493054968, https://openalex.org/W1995876561, https://openalex.org/W1553364858, https://openalex.org/W1596858679, https://openalex.org/W1516418648, https://openalex.org/W2090798572, https://openalex.org/W2037008576, https://openalex.org/W1505455772, https://openalex.org/W2011567991, https://openalex.org/W1606419968, https://openalex.org/W2130003285, https://openalex.org/W2104126268, https://openalex.org/W1680665078, https://openalex.org/W1845639139, https://openalex.org/W1543395740 |
| referenced_works_count | 21 |
| abstract_inverted_index.a | 56, 60, 76, 81, 158, 169 |
| abstract_inverted_index.In | 0 |
| abstract_inverted_index.We | 97, 106, 126, 139 |
| abstract_inverted_index.be | 145 |
| abstract_inverted_index.by | 95 |
| abstract_inverted_index.in | 49, 154 |
| abstract_inverted_index.is | 24, 89, 110, 119, 168 |
| abstract_inverted_index.it | 13, 45, 53, 68, 88 |
| abstract_inverted_index.of | 29, 75, 136, 157, 171 |
| abstract_inverted_index.on | 26 |
| abstract_inverted_index.or | 59 |
| abstract_inverted_index.to | 112, 147 |
| abstract_inverted_index.we | 3, 8, 103 |
| abstract_inverted_index.For | 19 |
| abstract_inverted_index.and | 11, 34, 160 |
| abstract_inverted_index.but | 117 |
| abstract_inverted_index.can | 144 |
| abstract_inverted_index.for | 65, 114, 123 |
| abstract_inverted_index.has | 39 |
| abstract_inverted_index.how | 141 |
| abstract_inverted_index.new | 5, 130 |
| abstract_inverted_index.not | 120 |
| abstract_inverted_index.the | 15, 30, 35, 40, 50, 121, 134, 155, 172 |
| abstract_inverted_index.use | 135 |
| abstract_inverted_index.WFS. | 70 |
| abstract_inverted_index.also | 98, 127 |
| abstract_inverted_index.call | 9, 104 |
| abstract_inverted_index.case | 122 |
| abstract_inverted_index.head | 156 |
| abstract_inverted_index.over | 176 |
| abstract_inverted_index.show | 107 |
| abstract_inverted_index.that | 52, 102, 108, 132 |
| abstract_inverted_index.this | 1, 22, 118 |
| abstract_inverted_index.with | 14, 47 |
| abstract_inverted_index.(WFS) | 33 |
| abstract_inverted_index.(that | 7 |
| abstract_inverted_index.based | 25 |
| abstract_inverted_index.every | 72 |
| abstract_inverted_index.model | 58, 74, 83 |
| abstract_inverted_index.never | 54 |
| abstract_inverted_index.rules | 93 |
| abstract_inverted_index.sense | 51 |
| abstract_inverted_index.setof | 175 |
| abstract_inverted_index.these | 142 |
| abstract_inverted_index.third | 129 |
| abstract_inverted_index.using | 91 |
| abstract_inverted_index.which | 167 |
| abstract_inverted_index.First, | 44 |
| abstract_inverted_index.STABLE | 48 |
| abstract_inverted_index.Third, | 71 |
| abstract_inverted_index.agrees | 46 |
| abstract_inverted_index.model. | 63 |
| abstract_inverted_index.normal | 20, 66, 115 |
| abstract_inverted_index.paper, | 2 |
| abstract_inverted_index.second | 100 |
| abstract_inverted_index.stable | 16, 73 |
| abstract_inverted_index.Fourth, | 87 |
| abstract_inverted_index.STABLE. | 96 |
| abstract_inverted_index.Second, | 64 |
| abstract_inverted_index.clause, | 159 |
| abstract_inverted_index.compare | 12 |
| abstract_inverted_index.default | 152 |
| abstract_inverted_index.defines | 55 |
| abstract_inverted_index.extends | 69 |
| abstract_inverted_index.accepted | 94 |
| abstract_inverted_index.complete | 178 |
| abstract_inverted_index.explicit | 150 |
| abstract_inverted_index.extended | 146 |
| abstract_inverted_index.implicit | 137 |
| abstract_inverted_index.negation | 153 |
| abstract_inverted_index.operator | 174 |
| abstract_inverted_index.programs | 67, 116, 148 |
| abstract_inverted_index.suitable | 27 |
| abstract_inverted_index.supports | 133 |
| abstract_inverted_index.(STABLE). | 18 |
| abstract_inverted_index.Clark’s | 36 |
| abstract_inverted_index.appealing | 42 |
| abstract_inverted_index.arbitrary | 177 |
| abstract_inverted_index.following | 41 |
| abstract_inverted_index.including | 149 |
| abstract_inverted_index.introduce | 4, 99, 128 |
| abstract_inverted_index.lattices. | 179 |
| abstract_inverted_index.negation, | 151 |
| abstract_inverted_index.programs, | 21 |
| abstract_inverted_index.programs. | 125 |
| abstract_inverted_index.semantics | 6, 17, 23, 32, 101, 131, 143 |
| abstract_inverted_index.supported | 62 |
| abstract_inverted_index.a<mml:math | 161 |
| abstract_inverted_index.equivalent | 111 |
| abstract_inverted_index.illustrate | 140 |
| abstract_inverted_index.nonminimal | 57, 61 |
| abstract_inverted_index.D3-WFS-DCOM | 38, 82 |
| abstract_inverted_index.aggregation | 173 |
| abstract_inverted_index.completion. | 37 |
| abstract_inverted_index.constructed | 90 |
| abstract_inverted_index.disjunctive | 77, 124 |
| abstract_inverted_index.integration | 28 |
| abstract_inverted_index.of<mml:math | 84 |
| abstract_inverted_index.properties: | 43 |
| abstract_inverted_index.D2-WFS-DCOMP | 109 |
| abstract_inverted_index.D3-WFS-DCOMP | 113 |
| abstract_inverted_index.well-founded | 31 |
| abstract_inverted_index.D2-WFS-DCOMP. | 105 |
| abstract_inverted_index.D3-WFS-DCOMP) | 10 |
| abstract_inverted_index.disjunctions. | 138 |
| abstract_inverted_index.generalization | 170 |
| abstract_inverted_index.transformation | 92 |
| abstract_inverted_index.id="M3"><mml:mi | 163 |
| abstract_inverted_index.program<mml:math | 78 |
| abstract_inverted_index.mathvariant="normal">l</mml:mi><mml:mi | 164 |
| abstract_inverted_index.mathvariant="normal">u</mml:mi><mml:mi | 165 |
| abstract_inverted_index.xmlns:mml="http://www.w3.org/1998/Math/MathML" | 79, 85, 162 |
| abstract_inverted_index.mathvariant="normal">b</mml:mi></mml:math>operator, | 166 |
| abstract_inverted_index.id="M2"><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:math>. | 86 |
| abstract_inverted_index.id="M1"><mml:mrow><mml:mi>P</mml:mi></mml:mrow></mml:math>is | 80 |
| cited_by_percentile_year.max | 96 |
| cited_by_percentile_year.min | 94 |
| corresponding_author_ids | https://openalex.org/A5045363362 |
| countries_distinct_count | 2 |
| institutions_distinct_count | 2 |
| corresponding_institution_ids | https://openalex.org/I90267481 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/4 |
| sustainable_development_goals[0].score | 0.5299999713897705 |
| sustainable_development_goals[0].display_name | Quality Education |
| citation_normalized_percentile.value | 0.02032605 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |