• Login
    View Item 
    •   Athenaeum Home
    • Institute for Artificial Intelligence
    • CASPR Research Reports
    • View Item
    •   Athenaeum Home
    • Institute for Artificial Intelligence
    • CASPR Research Reports
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Natural language plurals in logic programming queries

    Thumbnail
    View/Open
    ai199601.dvi (43.46Kb)
    ai199601.pdf (127.0Kb)
    ai199601.ps (276.2Kb)
    Date
    1996-02
    Author
    Covington, Michael A.
    Metadata
    Show full item record
    Abstract
    This paper presents a representation for natural language plurals in knowledge base queries, implementing collective, distributive, cumulative, and multiply distributive senses of the plural by means of higher predicates. The underlying semantics is based on Franconi’s theory of collections. The collective reading of a plural applies the predicate to the whole collection; the distributive reading applies the predicate to all of the elements; and the cumulative reading says that each element either satisfies the predicate, or belongs to some collection that does so. Implicit in the cumulative reading is the notion of element– property, the property of belonging to some collection that satisfies a given predicate. Another reading of the plural, here termed the multiply distributive, requires a straightforward extension of the system to allow simultaneous distribution over more than one variable at once, with none of the distributions having scope over any other. Simultaneous distribution is implemented as a metalogical predicate that transforms queries before executing them.
    URI
    http://hdl.handle.net/10724/30235
    Collections
    • CASPR Research Reports

    About Athenaeum | Contact Us | Send Feedback
     

     

    Browse

    All of AthenaeumCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    About Athenaeum | Contact Us | Send Feedback