Results 11  20
of
23
Definites and the Proper Treatment of Rabbits
 in Proceedings of Inference in Computational Semantics, eds., Christof Monz and Maarten de Rijke
, 1999
"... We argue that model generation programs, i.e., deduction systems that automatically compute the interpretations satisfying a given formula, can provide a procedural interpretation for semantic theories of natural language. We illustrate this claim by describing how the higherorder model generat ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
We argue that model generation programs, i.e., deduction systems that automatically compute the interpretations satisfying a given formula, can provide a procedural interpretation for semantic theories of natural language. We illustrate this claim by describing how the higherorder model generator Kimba interprets definite descriptions. 1 Introduction The concept of a Discourse Model has repeatedly been advocated as an essential component of natural language understanding. In cognitive psychology, discourse models have been used to explain inferences that people draw in understanding text [3]. In artificial intelligence, Webber proposes them as describing the situation/state which the speaker is talking about [21]. The understanding task then consists in an attempt by the listener to synthesize the appropriate discourse model. In the dynamic/DRT (Discourse Representation Theory [10]) trend of natural language semantics, it represents the context created by previous discourse and ...
Application of model search to lattice theory
 AAA Newsletter
, 2001
"... We have used the firstorder modelsearching programs MACE and SEM to study various problems in lattice theory. First, we present a case study in which the two programs are used to examine the differences between the stages along the way from lattice theory to Boolean algebra. Second, we answer seve ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
We have used the firstorder modelsearching programs MACE and SEM to study various problems in lattice theory. First, we present a case study in which the two programs are used to examine the differences between the stages along the way from lattice theory to Boolean algebra. Second, we answer several questions posed by Norman Megill and Mladen Pavičić on
Model Generation without Normal Forms and Applications in NaturalLanguage Semantics
, 1998
"... . I present a new tableauxbased model generation method for firstorder formulas without function symbols. Unlike comparable approaches, the Relational Models (RM) tableaux calculus does not require clausal input theories. I propose some applications of the RM calculus in naturallanguage semantics ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
. I present a new tableauxbased model generation method for firstorder formulas without function symbols. Unlike comparable approaches, the Relational Models (RM) tableaux calculus does not require clausal input theories. I propose some applications of the RM calculus in naturallanguage semantics and discuss its usefulness as an inference procedure in naturallanguage processing. 1 Introduction Refutational methods in automated deduction prove the unsatisfiability of logical theories. For many applications, the interpretations of a theory that show its satisfiability are at least as interesting as proofs. Model generation refers to the automatic construction of such interpretations from firstorder theories. In the recent years, there has been a growing interest in the automated deduction community in developing model generation methods for various application areas such as finite mathematics [25, 22], deductive databases [7], diagnosis [13, 1], and planning [19]. As a result, mode...
Reducing Symmetries to Generate Easier SAT Instances
, 2005
"... Finding countermodels is an effective way of disproving false conjectures. In firstorder predicate logic, model finding is an undecidable problem. But if a finite model exists, it can be found by exhaustive search. The finite model generation problem in the firstorder logic can also be translated ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Finding countermodels is an effective way of disproving false conjectures. In firstorder predicate logic, model finding is an undecidable problem. But if a finite model exists, it can be found by exhaustive search. The finite model generation problem in the firstorder logic can also be translated to the satisfiability problem in the propositional logic. But a direct translation may not be very efficient. This paper discusses how to take the symmetries into account so as to make the resulting problem easier. A static method for adding constraints is presented, which can be thought of as an approximation of the least number heuristic (LNH). Also described is a dynamic method, which asks a model searcher like SEM to generate a set of partial models, and then gives each partial model to a propositional prover. The two methods are analyzed, and compared with each other.
The Flowering of Automated Reasoning
, 2001
"... This article celebrates with obvious joy the role automated reasoning now plays for mathematics and logic. Simultaneously, this article evidences the realization of a dream thought impossible just four decades ago by almost all. But there were believers, including Joerg Siekmann to whom this article ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
This article celebrates with obvious joy the role automated reasoning now plays for mathematics and logic. Simultaneously, this article evidences the realization of a dream thought impossible just four decades ago by almost all. But there were believers, including Joerg Siekmann to whom this article is dedicated in honor of his sixtieth birthday. Indeed, today (in the year 2001)...
Logical Basis for the Automation of Reasoning: Case Studies 1
"... 2.1 Components of the clause language paradigm.................................... 4 ..."
Abstract
 Add to MetaCart
2.1 Components of the clause language paradigm.................................... 4
Generating SAT Instances from FirstOrder Formulas
"... Huang Z, Zhang J. Generating SAT instances from firstorder formulas. Journal of Software, 2005,16(3): ..."
Abstract
 Add to MetaCart
Huang Z, Zhang J. Generating SAT instances from firstorder formulas. Journal of Software, 2005,16(3):
On Different ProofSearch
"... Abstract. In this paper, we consider three different search strategies for a cutfree sequent system formalizing orthologic, and estimate the respective search spaces. Applying backward search, there are classes of formulae for which both the minimal proof length and the search space are exponential ..."
Abstract
 Add to MetaCart
Abstract. In this paper, we consider three different search strategies for a cutfree sequent system formalizing orthologic, and estimate the respective search spaces. Applying backward search, there are classes of formulae for which both the minimal proof length and the search space are exponential. In a combined forward and backward approach, all proofs are polynomial, but the potential search space remains exponential. Using a forward strategy, the potential search space becomes polynomial yielding a polynomial decision procedure for orthologic and the word problem for free ortholattices.