ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Feature grammars for semantic analysis (1990)
    Oxford, UK : Blackwell Publishing Ltd
    Computational intelligence 6 (1990), S. 0 
    Details
    ISSN: 1467-8640
    Source: Blackwell Publishing Journal Backfiles 1879-2005
    Topics: Computer Science
    Notes: In this paper, we present a formalism called feature grammar and its application to several problems of semantic analysis. Our extension concerns the structure of the feature value sets, which can be complex, and the definition of unification, which is dependent on this structure. Moreover, we introduce generation rules for feature symbols in order to determine well-formed symbols, which form the alphabet of a formal language for natural language analysis.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1111/j.1467-8640.1990.tb00132.x
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Embedding deductive capabilities in relational database systems (1984)
    Springer
    International journal of parallel programming 13 (1984), S. 327-338 
    Details
    ISSN: 1573-7640
    Keywords: Deductive database systems ; relational algebra ; theorem proving ; Horn-clauses
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract The basic idea of our work is to include deductive capabilities in a relational database system by fully using the operands of relational algebra and without using any theorem prover. We present a deductive database system where the user can formulate deduction laws as logical formulas, but which works on an underlying relational database system by fully using the data manipulation routines of such a system. Generally, it is not possible to express the deduction laws by means of expressions of relational algebra (see Ref. 1). In our system, a relational algebra expression is associated with every database deduction law. The result of its evaluation (with respect to an underlying database) is the set of all database entries that can be deduced from the database by applying the respective law once (Theorem 1). By successively applying all these relational expressions for all the database deduction laws it is possible to generate the whole extensional database (i.e. all tuples deducible from the database).
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00991656
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Tableau-based characterization and theorem proving for default logic (1994)
    Springer
    Journal of automated reasoning 13 (1994), S. 223-242 
    Details
    ISSN: 1573-0670
    Keywords: nonmonotonic logic ; default logic ; tableaux
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract In this paper, we present a new method for computing extensions and for deriving formulae from a default theory. It is based on the semantic tableaux method and works for default theories with a finite set of defaults that are formulated over a decidable subset of first-order logic. We prove that all extensions (if any) of a default theory can be produced by constructing the semantic tableau ofone formula built from the general laws and the default consequences. This result allows us to describe an algorithm that provides extensions if there are any, and to decide if there are none. Moreover, the method gives a necessary and sufficient criterion for the existence of extensions of default theories with finitely many defaults provided they are formulated on a decidable subset of FOL.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00881957
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 4
    facet.materialart.
    Unknown
    Feature grammars for semantic analysis (1990)
    Wiley
    Details
    Publication Date: 1990-08-01
    Print ISSN: 0824-7935
    Electronic ISSN: 1467-8640
    Topics: Computer Science
    Published by Wiley
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    PAPER CURRENT
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...