Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
ground terms
Description:
Expressions in formal logic or term-rewriting systems that contain no variables.
Primary topic:
Logic, programming, and type systems (60%)
Related topics:
Logic, programming, and type systems (60%),
Atomic and Molecular Physics (11%),
semigroups and automata theory (8%)
OpenAlex ID:
keywords/ground-terms
Confluence properties of weak and strong calculi of explicit substitutions
1996
·
Pierre-Louis Curien
, Thérèse Hardin
, et al.
·
Journal of the ACM
·
166
PDF
Grounding and Solving in Answer Set Programming
2016
·
Benjamin Kaufmann
, Nicola Leone
, et al.
·
AI Magazine
·
98
PDF
Hierarchic Superposition with Weak Abstraction
2013
·
Peter Baumgartner
, Uwe Waldmann
·
Lecture notes in computer science
·
61
Third order matching is decidable
1994
·
Gilles Dowek
·
Annals of Pure and Applied Logic
·
52
PDF
Logimix: A Self-Applicable Partial Evaluator for Prolog
1993
·
Torben Æ. Mogensen
, Anders Bondorf
·
Workshops in computing
·
45
On using ground joinable equations in equational theorem proving
2003
·
J. Avenhaus
, Th. Hillenbrand
, et al.
·
Journal of Symbolic Computation
·
41
PDF
Theory and importance of oxygen bridge-bonding
1971
·
B. Jeżowska-Trzebiatowska
·
Pure and Applied Chemistry
·
38
PDF
Systems of set constraints with negative constraints are NEXPTIME-complete
2002
·
K. Stefansson
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
37
Anti-pattern Matching
2007
·
Claude Kirchner
, Radu Kopetz
, et al.
·
Lecture notes in computer science
·
35
Serien im Funkenspektrum des Radiums. Ra II
1933
·
Ebbe Rasmussen
·
The European Physical Journal A
·
34
Effective Spin–Orbit Hamiltonian
1970
·
N. Karayianis
·
The Journal of Chemical Physics
·
31
The Combinator S
2000
·
Johannes Waldmann
·
Information and Computation
·
29
PDF
The reachability and joinability problems for right-ground term-rewriting systems
1991
·
Michio Oyamaguchi
·
Journal of information processing
·
27
Levels of undecidability in rewriting
2010
·
Jörg Endrullis
, Herman Geuvers
, et al.
·
Information and Computation
·
25
PDF
For a rewrite system it is decidable whether the set of irreducible, ground terms is regognizable.
1992
·
Sándor Vágvölgyi
, Rémi Gilleron
·
Bulletin of the European Association for Theoretical Computer Science
·
25
Type Synthesis for Ground Prolog.
1987
·
Feliks Kluźniak
·
23
Terms of N VI and O VII
1973
·
S C Baker
·
Journal of Physics B Atomic and Molecular Physics
·
23
PDF
Optical Spectrum of Triply Ionized Erbium in Calcium Tungstate
1971
·
D. E. Wortman
·
The Journal of Chemical Physics
·
23
Total termination of term rewriting
1996
·
M. C. F. Ferreira
, H. Zantema
·
Applicable Algebra in Engineering Communication and Computing
·
22
On the word problem for right-ground term-rewriting systems
1990
·
Michio Oyamaguchi
·
Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E
·
22
Towards fast and declarative meta-programming
1995
·
Antony F. Bowers
, Corin Gurr
·
Bristol Research (University of Bristol)
·
20
A total, ground path ordering for proving termination of AC-rewrite systems
1997
·
Deepak Kapur
, G. Sivakumar
·
Lecture notes in computer science
·
19
Negation Elimination in Empty or Permutative Theories
1998
·
M. Fernández
·
Journal of Symbolic Computation
·
18
PDF
An effective method for handling initial algebras
1988
·
Hubert Comon
·
Lecture notes in computer science
·
18
Conditional Congruence Closure over Uninterpreted and Interpreted Symbols
2019
·
Deepak Kapur
·
Journal of Systems Science and Complexity
·
17
Show more works
View as search
Works count:
146
Citation count:
1,441
Year
Topic
Type