Results 11 -
15 of
15
Model Generation without Normal Forms and Applications in Natural-Language Semantics
, 1998
"... . I present a new tableaux-based model generation method for first-order 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 natural-language semantics ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
. I present a new tableaux-based model generation method for first-order 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 natural-language semantics and discuss its usefulness as an inference procedure in natural-language 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 first-order 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...
www.elsevier.com/locate/entcs Reducing Symmetries to Generate Easier SAT Instances 1
"... Finding countermodels is an effective way of disproving false conjectures. In first-order 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 first-order 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 first-order 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 first-order 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.
MACE 2.0 Reference Manual and Guide
- Technical Memorandum ANL/MCS-TM-249, Argonne National Laboratory
, 2001
"... Contract W-31-109-Eng-38. Argonne National Laboratory, with facilities in the states of Illinois and Idaho, is owned by the United States Government and operated by The University of Chicago under the provisions of a contract with the Department of Energy. DISCLAIMER This report was prepared as an a ..."
Abstract
- Add to MetaCart
Contract W-31-109-Eng-38. Argonne National Laboratory, with facilities in the states of Illinois and Idaho, is owned by the United States Government and operated by The University of Chicago under the provisions of a contract with the Department of Energy. DISCLAIMER This report was prepared as an account of work sponsored by an agency of the United States Government. Neither the United States Government nor any agency thereof, nor The University of Chicago, nor any of their employees or officers, makes any warranty, express or implied, or assumes any legal liability or responsibility for the accuracy, completeness, or usefulness of any information, apparatus, product, or process disclosed, or represents that its use would not infringe privately-owned rights. Reference herein to any specific commercial product, process, or service by trade name, trademark, manufacturer, or otherwise, does not necessarily constitute or imply its endorsement, recommendation, or favoring by the United States Government or any agency thereof. The views and opinions of document authors expressed herein do not necessarily state or reflect those of the United States Government or any agency thereof, Argonne National Laboratory, or The University of Chicago. ii

