Results 1  10
of
59
Interpreting Definites using Model Generation
, 2000
"... We argue that model generation programs, i.e., deduction systems that automatically compute the models satisfying a given finite set of formulas, can provide a procedural interpretation for semantic theories of natural language. We illustrate this claim by describing how singular definite descriptio ..."
Abstract

Cited by 17 (0 self)
 Add to MetaCart
We argue that model generation programs, i.e., deduction systems that automatically compute the models satisfying a given finite set of formulas, can provide a procedural interpretation for semantic theories of natural language. We illustrate this claim by describing how singular definite descriptions can be interpreted using the higherorder model generator KIMBA.
Representing and Reasoning about Temporal Granularities
, 2004
"... In this paper, we propose a new logical approach to represent and to reason about different time granularities. We identify a time granularity as an infinite sequence of time points properly labelled with proposition symbols marking the starting and ending points of the corresponding granules, and ..."
Abstract

Cited by 12 (0 self)
 Add to MetaCart
In this paper, we propose a new logical approach to represent and to reason about different time granularities. We identify a time granularity as an infinite sequence of time points properly labelled with proposition symbols marking the starting and ending points of the corresponding granules, and we symbolically model sets of granularities by means of linear time logic formulas. Some realworld granularities are provided, from a clinical domain and from the Gregorian Calendar, to motivate and exemplify our approach. Different formulas are introduced, which represent relations between different granularities. The proposed framework permits one to algorithmically solve the consistency, the equivalence, and the classification problems in a uniform way, by reducing them to the validity problem for the considered linear time logic.
An ontology for grounding vague geographic terms
 In Formal Ontology in Information Systems  Proceedings of the Fifth International Conference (FOIS 2008
, 2008
"... Abstract. Many geographic terms, such as “river ” and “lake”, are vague, with no clear boundaries of application. In particular, the spatial extent of such features is often vaguely carved out of a continuously varying observable domain. We present a means of defining vague terms using standpoint se ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
(Show Context)
Abstract. Many geographic terms, such as “river ” and “lake”, are vague, with no clear boundaries of application. In particular, the spatial extent of such features is often vaguely carved out of a continuously varying observable domain. We present a means of defining vague terms using standpoint semantics, a refinement of the philosophical idea of supervaluation semantics. Such definitions can be grounded in actual data by geometric analysis and segmentation of the data set. The issues raised by this process with regard to the nature of boundaries and domains of logical quantification are discussed. We describe a prototype implementation of a system capable of segmenting attributed polygon data into geographically significant regions and evaluating queries involving vague geographic feature terms.
Extraction of semantic representations from syntactic cmu link grammar linkages
 Proceedings of Recent Advances in Natural Lanugage Processing
, 2001
"... A method for generating a Discourse Representation Structure (DRS) semantic representation from the output of the Carnegie Mellon University (CMU) link grammar parser is presented. The techniques used in extracting information from the link grammar representation and construction of the DRS are de ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
A method for generating a Discourse Representation Structure (DRS) semantic representation from the output of the Carnegie Mellon University (CMU) link grammar parser is presented. The techniques used in extracting information from the link grammar representation and construction of the DRS are detailed. The system is a major component of the EU funded ViSiCAST (Virtual Signing: Capture, Animation, Storage and Transmission) project 1 for presenting English text as sign language presentations. 1
Recognising textual entailment with robust logical inference
 MLCW 2005, volume LNAI 3944
, 2006
"... Abstract. We use logical inference techniques for recognising textual entailment, with theorem proving operating on deep semantic interpretations as the backbone of our system. However, the performance of theorem proving on its own turns out to be highly dependent on a wide range of background knowl ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
(Show Context)
Abstract. We use logical inference techniques for recognising textual entailment, with theorem proving operating on deep semantic interpretations as the backbone of our system. However, the performance of theorem proving on its own turns out to be highly dependent on a wide range of background knowledge, which is not necessarily included in publically available knowledge sources. Therefore, we achieve robustness via two extensions. Firstly, we incorporate model building, a technique borrowed from automated reasoning, and show that it is a useful robust method to approximate entailment. Secondly, we use machine learning to combine these deep semantic analysis techniques with simple shallow word overlap. The resulting hybrid model achieves high accuracy on the RTE testset, given the state of the art. Our results also show that the various techniques that we employ perform very differently on some of the subsets of the RTE corpus and as a result, it is useful to use the nature of the dataset as a feature. 1
Corega Tabs: Incremental Semantic Composition
 In: G. Brewka (Editor), Principles of Knowledge Representation (Studies in Logic Language and Information), Center for the Study of Language and Information  1
, 2002
"... In parsing natural language, incremental semantics composition is one of the most prominent issues. In the past, numerous approaches have been developed for assigning meaning to noun and verbal phrases and their complements and modifiers. Often, their inferential power is too low for practical appli ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
In parsing natural language, incremental semantics composition is one of the most prominent issues. In the past, numerous approaches have been developed for assigning meaning to noun and verbal phrases and their complements and modifiers. Often, their inferential power is too low for practical applications or the expressiveness of the representation language leads to intractable inference procedures. As an answer to these problems, we discuss an approach that relies on Description Logics for handling this class of semantics construction. We show how a semantic knowledge base can be setup. We exploit the equivalence between Discourse Representation Structures limited to the expressiveness of ALC and ABoxes for validating DRS with respect to a given knowledge base.
Representing and reasoning about temporal granularities
 Journal of Logic and Computation
, 2004
"... In this paper, we propose a new logical approach to represent and to reason about different time granularities. We identify a time granularity as an infinite sequence of time points properly labelled with proposition symbols marking the starting and ending points of the corresponding granules, and w ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
(Show Context)
In this paper, we propose a new logical approach to represent and to reason about different time granularities. We identify a time granularity as an infinite sequence of time points properly labelled with proposition symbols marking the starting and ending points of the corresponding granules, and we symbolically model sets of granularities by means of linear time logic formulas. Some realworld granularities are provided, from a clinical domain and from the Gregorian Calendar, to motivate and exemplify our approach. Different formulas are introduced, which represent relations between different granularities. The proposed framework permits to algorithmically solve the consistency, the equivalence, and the classification problems in a uniform way, by reducing them to the validity problem for the considered linear time logic.
Parsing formulae in textbook proofs
 Tilburg University
, 1999
"... Our longrange goal is to implement a program for the machine verification of textbook proofs. The problem was first tackled by Simon [Sim88]. However, Simon does not claim to have used or developed an adequate theory for semantics construction. A prerequisite for parsing textbook proofs is to being ..."
Abstract

Cited by 4 (4 self)
 Add to MetaCart
(Show Context)
Our longrange goal is to implement a program for the machine verification of textbook proofs. The problem was first tackled by Simon [Sim88]. However, Simon does not claim to have used or developed an adequate theory for semantics construction. A prerequisite for parsing textbook proofs is to being able to parse terms and formulae that occur in these proofs. We analyze a typical textbook proof and describe some of the linguistic phenomena one has to cope with, focusing on problems that involve the handling of terms and formulae. We propose, contrarily to Simon, an adequate theory for semantics construction, namely DRT, which, however, must be adapted to fit our needs. 2 Linguistic analysis Fig. 1 depicts a typical proof taken from a standard textbook on elementary number theory. We analyze it from the linguistics perspective focusing on potential difficulties: Constants and variables have a domain and scope which extends across text and formulae. Obviously, the occurrences of p in p  ab, p  a and p  b (Fig. 1, line 4) refer to their first occurrence in if p is prime (same line). However, it is not required that the occurrences of p, a and b in line 8 refer to the occurrences of p, a and b in line 4. The term abc...l (line 8) describes the factorization of objects a,b,c,...,l. Albeit the missing c, the phrase a,b,... l (line 9) enumerates also the factors a,b,c,...,l. Equally, q b1 1... qbj j the terms p a1 (line 13) refers to the same mathematical entity as qb1 1 qb2 2...qbj j
Temporalized logics and automata for time granularity. Theory and Practice of Logic Programming
 Research on Language and Computation
, 2004
"... The ability of providing and relating temporal representations at different ‘grain levels’ of the same reality is an important research theme in computer science and a major requirement for many applications, including formal specification and verification, temporal databases, data mining, problem s ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
The ability of providing and relating temporal representations at different ‘grain levels’ of the same reality is an important research theme in computer science and a major requirement for many applications, including formal specification and verification, temporal databases, data mining, problem solving, and natural language understanding. In particular, the addition of a granularity dimension to a temporal logic makes it possible to specify in a concise way reactive systems whose behaviour can be naturally modeled with respect to a (possibly infinite) set of differentlygrained temporal domains. Suitable extensions of the monadic secondorder theory of k successors have been proposed in the literature to capture the notion of time granularity. In this paper, we provide the monadic secondorder theories of downward unbounded layered structures, which are infinitely refinable structures consisting of a coarsest domain and an infinite number of finer and finer domains, and of upward unbounded layered structures, which consist of a finest domain and an infinite number of coarser and coarser domains, with expressively complete and elementarily decidable temporal logic counterparts. We obtain such a result in two steps. First, we define a new class of combined automata, called temporalized automata, which can be proved to be the automatatheoretic counterpart of temporalized logics, and show that relevant properties, such as closure under Boolean operations, decidability, and expressive equivalence with respect to temporal logics, transfer from component automata to temporalized ones. Then, we exploit the correspondence between temporalized logics and automata to reduce the task of finding the temporal logic counterparts of the given theories of time granularity to the easier one of finding temporalized automata counterparts of them. 1