Sciweavers

6829 search results - page 1115 / 1366
» Quantitative Generalizations of Languages
Sort
View
LPNMR
1993
Springer
15 years 8 months ago
Negation as Partial Failure
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
Bamshad Mobasher, Jacek Leszczylowski, Don Pigozzi
ISSAC
1994
Springer
102views Mathematics» more  ISSAC 1994»
15 years 8 months ago
An Application of Symbolic Computation in the Physical Sciences
An example of a problem in the physical sciences is discussed where application of various symbolic computation facilities available in many algebraic computing systems leads to a...
Charles C. Dyer
ECAI
1992
Springer
15 years 8 months ago
A Strategy for the Computation of Conditional Answers
We consider non-Horn Deductive Data Bases (DDB) represented in a First Order language without function symbols. In this context the DDB is an incomplete description of the world. ...
Robert Demolombe
ACMSE
1990
ACM
15 years 8 months ago
Computerizing a machine readable dictionary
Current research in natural language processing is characterized by the development of theories of grammar which strongly depend on the lexicon to drive parsing systems (e.g. Lexi...
Jan G. Wilms
169
Voted
ECML
1998
Springer
15 years 8 months ago
Predicate Invention and Learning from Positive Examples Only
Previous bias shift approaches to predicate invention are not applicable to learning from positive examples only, if a complete hypothesis can be found in the given language, as ne...
Henrik Boström
« Prev « First page 1115 / 1366 Last » Next »