Results 1  10
of
5,132
Efficient semantic matching
, 2004
"... We think of Match as an operator which takes two graphlike structures and produces a mapping between semantically related nodes. We concentrate on classifications with tree structures. In semantic matching, correspondences are discovered by translating the natural language labels of nodes into prop ..."
Abstract

Cited by 855 (68 self)
 Add to MetaCart
into propositional formulas, and by codifying matching into a propositional unsatisfiability problem. We distinguish between problems with conjunctive formulas and problems with disjunctive formulas, and present various optimizations. For instance, we propose a linear time algorithm which solves the first class
Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search
, 1996
"... Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to scale up gracefully. By combining a general, stochastic search algorithm and appropriate problem encodings based on propositional logic, we are able to solve hard planning pr ..."
Abstract

Cited by 579 (33 self)
 Add to MetaCart
Planning is a notoriously hard combinatorial search problem. In many interesting domains, current planning algorithms fail to scale up gracefully. By combining a general, stochastic search algorithm and appropriate problem encodings based on propositional logic, we are able to solve hard planning
A New Method for Solving Hard Satisfiability Problems
 AAAI
, 1992
"... We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approac ..."
Abstract

Cited by 730 (21 self)
 Add to MetaCart
We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional
The complexity of theoremproving procedures
 IN STOC
, 1971
"... It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract

Cited by 1050 (5 self)
 Add to MetaCart
It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved
Why a diagram is (sometimes) worth ten thousand words
 Cognitive Science
, 1987
"... We distinguish diagrammatic from sentential paperandpencil representationsof information by developing alternative models of informationprocessing systems that are informationally equivalent and that can be characterized as sentential or diagrammatic. Sentential representations are sequential, li ..."
Abstract

Cited by 804 (2 self)
 Add to MetaCart
, like the propositions in a text. Dlogrammotlc representations ore indexed by location in a plane. Diogrommatic representations also typically display information that is only implicit in sententiol representations and that therefore has to be computed, sometimes at great cost, to make it explicit
Motivation through the Design of Work: Test of a Theory. Organizational Behavior and Human Performance,
, 1976
"... A model is proposed that specifies the conditions under which individuals will become internally motivated to perform effectively on their jobs. The model focuses on the interaction among three classes of variables: (a) the psychological states of employees that must be present for internally motiv ..."
Abstract

Cited by 622 (2 self)
 Add to MetaCart
under government sponsorship are encouraged to express their own judgment freely, this report does not necessarily represent the official opinion or policy of the government. redesign are not fully adequate to meet the problems encountered in their application. Especially troublesome is the paucity
Fusion, Propagation, and Structuring in Belief Networks
 ARTIFICIAL INTELLIGENCE
, 1986
"... Belief networks are directed acyclic graphs in which the nodes represent propositions (or variables), the arcs signify direct dependencies between the linked propositions, and the strengths of these dependencies are quantified by conditional probabilities. A network of this sort can be used to repre ..."
Abstract

Cited by 484 (8 self)
 Add to MetaCart
structured), then probabilities can be updated by local propagation in an isomorphic network of parallel and autonomous processors and that the impact of new information can be imparted to all propositions in time proportional to the longest path in the network. The second part of the paper deals with the problem of finding a
The role of knowledge in discourse comprehension: A constructionintegration model
 Psychological Review
, 1988
"... In contrast to expectationbased, predictive views of discourse comprehension, a model is developed in which the initial processing is strictly bottomup. Word meanings are activated, propositions are formed, and inferences and elaborations are produced without regard to the discourse context. Howev ..."
Abstract

Cited by 476 (7 self)
 Add to MetaCart
In contrast to expectationbased, predictive views of discourse comprehension, a model is developed in which the initial processing is strictly bottomup. Word meanings are activated, propositions are formed, and inferences and elaborations are produced without regard to the discourse context
The Computational Complexity of Propositional STRIPS Planning
 Artificial Intelligence
, 1994
"... I present several computational complexity results for propositional STRIPS planning, i.e., STRIPS planning restricted to ground formulas. Different planning problems can be defined by restricting the type of formulas, placing limits on the number of pre and postconditions, by restricting negation ..."
Abstract

Cited by 363 (3 self)
 Add to MetaCart
I present several computational complexity results for propositional STRIPS planning, i.e., STRIPS planning restricted to ground formulas. Different planning problems can be defined by restricting the type of formulas, placing limits on the number of pre and postconditions, by restricting negation
Planning as heuristic search,
 5 – 33, ISSN
, 2001
"... Abstract In the AIPS98 Planning Contest, the HSP planner showed that heuristic search planners can be competitive with stateoftheart Graphplan and SAT planners. Heuristic search planners like HSP transform planning problems into problems of heuristic search by automatically extracting heuristics ..."
Abstract

Cited by 421 (33 self)
 Add to MetaCart
Abstract In the AIPS98 Planning Contest, the HSP planner showed that heuristic search planners can be competitive with stateoftheart Graphplan and SAT planners. Heuristic search planners like HSP transform planning problems into problems of heuristic search by automatically extracting
Results 1  10
of
5,132