Efficiently Characterizing the Undefined Requests of a Rule-Based System (Q6104492): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-319-98938-9_5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2810865641 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Verification, validation, and integrity issues in expert and database systems: Two perspectives / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3601414 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Enumerating Infeasibility: Finding Multiple MUSes Quickly / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 12:38, 1 August 2024
scientific article; zbMATH DE number 7703759
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficiently Characterizing the Undefined Requests of a Rule-Based System |
scientific article; zbMATH DE number 7703759 |
Statements
Efficiently Characterizing the Undefined Requests of a Rule-Based System (English)
0 references
28 June 2023
0 references
