CoChat
Sign Up
Cited by 36Logic, Reasoning, and KnowledgeSyntax, Semantics, Linguistic VariationAdvanced Algebra and Logic

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Feature Logics

Rounds, William C.·1997·Handbook of Logic and Language
DOI 10.1016/b978-044481714-3/50012-6
Open this paper in CoChat — free account

Overview

Integrity signals

Registry

Crossref · 10.1016/b978-044481714-3/50012-6

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Flagged first, then by citations

Show all 1 references

Research works printed but not linked: 25

  1. Abramsky, 1991, Domain theory in logical form, Ann. Pure Appl. Logic, 51, 10.1016/0168-0072(91)90065-T · DOI
  2. Aczel, 1988, Non-Well-Founded Sets, Center for Study of Language and Information Lecture Notes no. 14
  3. Baader, 1991, On the expressivity of feature logics with negation, functional uncertainty, and sort equations, Technical Report RR-91-01, DFKI
  4. Ben-Ari, 1982, Deterministic propositional dynamic logic: Finite models, complexity, and completeness, J. Comput. System Sci., 25, 402, 10.1016/0022-0000(82)90018-6 · DOI
  5. Blackburn, 1993, A modal perspective on the computational complexity of attribute value grammar, J. Logic, Lang., Inform., 2, 129, 10.1007/BF01050635 · DOI
  6. Bouma, 1992, Feature structures and nonmonotonicity, Comput. Ling., 18, 183
  7. Brachman, 1985, An overview of the kl-one knowledge representation system, Cogn. Science, 9, 171, 10.1207/s15516709cog0902_1 · DOI
  8. Cardelli, 1985, On understanding types, data abstractions, and polymorphism, ACM Comput. Surv., 17, 471, 10.1145/6041.6042 · DOI
  9. Dörre, 1992, On subsumption and semiunification in feature algebras, J. Symb. Comput., 13, 441, 10.1016/S0747-7171(08)80107-1 · DOI
  10. Fischer, 1979, Propositional dynamic logic of regular programs, J. Comput. System Sci., 18, 194, 10.1016/0022-0000(79)90046-1 · DOI
  11. Gazdar, 1988, Category structures, Comput. Ling., 14, 1
  12. Goldblatt, 1989, Varieties of complex algebras, Ann. Pure Appl. Logic, 44, 173, 10.1016/0168-0072(89)90032-8 · DOI
  13. Gurevich, 1966, The word problem for certain classes of semigroups, Algebra and Logic, 5, 25
  14. Hennessy, 1985, Algebraic laws for nondeterminism and concurrency, J. Assoc. Comput. Mach., 32, 137, 10.1145/2455.2460 · DOI
  15. Johnson, 1993, Some formal properties of stratified feature grammars, Ann. Math. Artif. Intell., 8, 10.1007/BF02451552 · DOI
  16. Johnson, 1991, Features and formulae, Comput. Ling., 17, 131
  17. Kasper, 1990, The logic of unification in grammar, Ling. and Philos., 13, 33, 10.1007/BF00630516 · DOI
  18. Kracht, 1989, On the logic of category definitions, Comput. Ling., 15, 111
  19. Lewis, 1980, Complexity results for classes of quantificational formulae, J. Comput. System Sci., 21, 317, 10.1016/0022-0000(80)90027-6 · DOI
  20. Moshier, 1993, Completeness theorems for logics of feature structures, Ann. Math. Artif. Intell., 8, 10.1007/BF02451553 · DOI
  21. Mukai, 1991, Clp(afa): Coinductive semantics of horn clauses with compact constraints, vol. 2, 179
  22. Pereira, 1980, Definite clause grammars for language analysis: A survey of the formalism and a comparison with augmented transition networks, Artif. Intell., 13, 231, 10.1016/0004-3702(80)90003-X · DOI
  23. Robinson, 1971, Undecidability and nonperiodicity for tilings of the plane, Invent. Math., 12, 177, 10.1007/BF01418780 · DOI
  24. Scott, 1982, Domains for Denotational Semantics, Lecture Notes in Comput. Sci., vol. 140, 10.1007/BFb0012801 · DOI
  25. Smolka, 1992, Feature constraint logics for unification grammars, J. Logic Programming, 12, 51, 10.1016/0743-1066(92)90039-6 · DOI

Cited by

Sorted by citations

See all 36

Metadata

Authors
Rounds, W. C.
Affiliations
University of Michigan (US)
Corresponding author
Rounds, William C.
Venue
Handbook of Logic and Language
Publisher
Elsevier
Published
1997
Pages
475-533
DOI
10.1016/b978-044481714-3/50012-6
OpenAlex
W3023167828
Cited by
36
References
1
Citations by year
2020: 1 · 2019: 22 · 2016: 1 · 2013: 1
FWCI
5.04
Type
book chapter
Language
en
Open access
closed
Licence
www.elsevier.com/tdm/userlicense/1.0/ (tdm)
Locations
Elsevier eBooks (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Logic, Reasoning, and Knowledge
  • Social Sciences › Arts and Humanities › Language and Linguistics › Syntax, Semantics, Linguistic Variation
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Algebra and Logic
Keywords
feature theory, feature structures, terminological logic, database query languages, relational databases, record structure, nonmonotonic reasoning, partial objects

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review