Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Term algebra

Known as: Term, Herbrand Universe, Herbrand term 
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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
We introduce and give formal definitions of attack-defense trees. We argue that these trees are a simple, yet powerful tool to… Expand
  • figure 1
  • table 1
  • table 2
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We present description logics of minimal knowledge and negation as failure (MKNF-DLs), which augment description logics with… Expand
  • figure 1
Is this relevant?
1997
1997
  • D. Saccá
  • J. Comput. Syst. Sci.
  • 1997
  • Corpus ID: 18802981
Various types of stable models are known in the literature:T-stable(total stable),P-stable(partial stable, also calledthree… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1996
Highly Cited
1996
One way to represent a machine learning algorithm's bias over the hypothesis and instance space is as a pair of probability… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
The problem of view updates in deductive databases is studied by casting this in a naturally associated abductive framework. It… Expand
Is this relevant?
Highly Cited
1989
Highly Cited
1989
A general logic program is a set of rules that have both positive and negative subgoals. We define negation in general logic… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1989
Highly Cited
1989
Roughly speaking, an equational problem is a first order formula whose only predicatesymbol is =. We propose some rules for the… Expand
  • figure 11
Is this relevant?
Highly Cited
1988
Highly Cited
1988
Algorithmic debugging, as presented by Shapiro, is an interactive process where the debugging system acquires knowledge about the… Expand
Is this relevant?
Highly Cited
1987
Highly Cited
1987
We address the problem of designing programming systems to reason with and about constraints. Taking a logic programming approach… Expand
Is this relevant?
Highly Cited
1932
Highly Cited
1932
In §3 of his paper, Algebras which do not possess a finite basis ^ J. H. M. Wedderburn gives a set of postulates and definitions… Expand
Is this relevant?