Record Beta
Mathematical Foundations of Computer Science (MFCS)
https://id.confref.org/data/confref-portal/event/mfcs1991
This record is part of the confref event International Symposium on Mathematical Foundations of Computer Science.
| rdf:type | portal:Conference |
|---|---|
| schema:location | Kazimierz Dolny (wd:Q774098) |
| rdfs:label | Mathematical Foundations of Computer Science (MFCS) |
| portal:acronym | MFCS |
| portal:area | https://id.confref.org/data/confref-portal/area/2 |
| portal:city | Kazimierz Dolny |
| portal:country | Poland |
| portal:endDate | 1991-09-13 |
| portal:keyword | AC-Disunification |
| portal:keyword | Associative and Commutative Reasoning |
| portal:keyword | Sufficient-completeness |
| portal:keyword | The Subsumption Lattice of First-Order terms |
| portal:keyword | inductive learning |
| portal:keyword | pattern-matching |
| portal:name | Mathematical Foundations of Computer Science (MFCS) |
| portal:portalPage | http://portal.confref.org/list/mfcs1991 |
| portal:series | https://id.confref.org/data/confref-portal/series/mfcs |
| portal:startDate | 1991-09-09 |
| portal:submissionExtended | false |
| portal:year | 1991 |
| cr:discipline | computer science (wd:Q21198) |
| cr:field | Computer and information sciences (https://id.confref.org/data/oecd-fos/1.2) |
| cr:sameAs | https://dblp.org/db/conf/mfcs/mfcs91 |
| cr:sameAs | https://id.confref.org/data/confident/43621 |
Beta confref labs is under development. Identifiers are stable; pages, data and services can change.