Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 224,708,360 papers from all fields of science
Search
Sign In
Create Free Account
Term algebra
Known as:
Term
, Herbrand Universe
, Herbrand term
Expand
In universal algebra and mathematical logic, a term algebra is a freely generated algebraic structure over a given signature. For example, in a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
18 relations
Abstract data type
Algebraic Petri net
Atomic formula
Category theory
Expand
Broader (1)
Unification (computer science)
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Decidable Fragments of Many-Sorted Logic
Aharon Abadi
,
A. Rabinovich
,
Shmuel Sagiv
Logic Programming and Automated Reasoning
2007
Corpus ID: 1315836
We investigate the possibility of developing a decidable logic which allows expressing a large variety of real world…
Expand
2003
2003
On the freedom of decryption
J. Millen
Information Processing Letters
2003
Corpus ID: 45479664
1997
1997
Object Logic Integration: A Multiparadigm Design Methodology and a Programming Language
Jimmy Ho-man Lee
,
P. K. C. Pun
Computer languages
1997
Corpus ID: 18845995
1996
1996
A Fibrational Semantics for Logic Programs
Y. Kinoshita
,
J. Power
Extensions of Logic Programming
1996
Corpus ID: 6771165
We introduce a new semantics for logic programming languages. It generalises the traditional Herbrand universe semantics, and…
Expand
1995
1995
Constrained relative least general generalization for Inducing Constraint Logic Programs
F. Mizoguchi
,
H. Ohwada
New generation computing
1995
Corpus ID: 20597238
Relative least general generalization proposed by Plotkin, is widely used for generalizing first-order clauses in Inductive Logic…
Expand
1992
1992
How Complicated is the Set of Stable Models of a Recursive Logic Program?
V. Marek
,
A. Nerode
,
J. Remmel
Annals of Pure and Applied Logic
1992
Corpus ID: 9348940
1992
1992
Embedding Finite Sets in a Logic Programming Language
A. Dovier
,
E. Omodeo
,
Enrico Pontelli
,
G. Rossi
Extensions of Logic Programming
1992
Corpus ID: 17673464
A way of introducing simple (finite) set designations and operations as firstclass objects of an (unrestricted) logic programming…
Expand
Highly Cited
1989
Highly Cited
1989
Negation as failure using tight derivations for general logic programs
Alan van Gelser
1989
Corpus ID: 122043864
1989
1989
The unification of functional and logic languages-towards constraint functional programming
J. Darlington
,
Y. Guo
Fourth IEEE Region 10 International Conference…
1989
Corpus ID: 16273154
Constraint functional programming (CEP) is presented as a new declarative programming paradigm. A CFP system is an integrated…
Expand
1986
1986
Invited Talk: Some Issues and Trends in the Semantics of Logic Programming
J. Jaffar
,
J. Lassez
,
Michael J. Maher
International Conference on Logic Programming
1986
Corpus ID: 17452134
The simplicity and elegance of definite clauses makes this formalism attractive from a theoretical point of view. The objects in…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE