Sciweavers

654 search results - page 38 / 131
» Ordered Sets and Complete Lattices
Sort
View
AAAI
1990
13 years 8 months ago
Decidable Reasoning in First-Order Knowledge Bases with Perfect Introspection
Since knowledge bases (KBs) are usually incomplete, they should be able to provide information regarding their own incompleteness, which requires them to introspect on what they k...
Gerhard Lakemeyer
EMNLP
2010
13 years 5 months ago
Inducing Probabilistic CCG Grammars from Logical Form with Higher-Order Unification
This paper addresses the problem of learning to map sentences to logical form, given training data consisting of natural language sentences paired with logical representations of ...
Tom Kwiatkowksi, Luke S. Zettlemoyer, Sharon Goldw...
JAR
2010
98views more  JAR 2010»
13 years 2 months ago
Proof-Guided Test Selection from First-Order Specifications with Equality
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulas with equality. We first prove the existence of an ide...
Delphine Longuet, Marc Aiguier, Pascale Le Gall
JCIT
2010
199views more  JCIT 2010»
13 years 2 months ago
Grey Relational Analysis Method for Multiple Attribute Decision Making in Intuitionistic Fuzzy Setting
The aim of this paper is to investigate the multiple attribute decision making problems with intuitionistic fuzzy information, in which the information about attribute weights is ...
Juchi Hou
IJCAI
1997
13 years 9 months ago
Equational Reasoning using AC Constraints
Unfailing completion is a commonly used technique for equational reasoning. For equational problems with associative and commutative functions, unfailing completion often generate...
David A. Plaisted, Yunshan Zhu