Name
Abstract | ||
|---|---|---|
A hypergraph model is introduced, which besides including the AND/OR graph and state space graph models as particulars, is adequate for problem solving tasks involving non independent subproblems. The hypergraph model is shown to be grounded on a nonstandard notion of conjunction such that the truth of a conjunction does not necessarily imply the truth of the conjuncts. A hypergraph search algorithm is given and shown to be equivalent to a resolution-based theorem prover in a first order logic augmented with the special conjunction. A characterization is given of the class of problems requiring the full descriptive power of our model. The class includes problems involving resources, plan formation, simplification of predicate logic programs. |
Year | Venue | Keywords |
|---|---|---|
1975 | IJCAI | plan formation,problem reduction model,full descriptive power,special conjunction,nonstandard notion,hypergraph search algorithm,non independent subproblems,order logic,hypergraph model,predicate logic program,state space graph model |
Field | DocType | Citations |
Graph,Discrete mathematics,Search algorithm,Computer science,Hypergraph,Automated theorem proving,First-order logic,Artificial intelligence,State space,Predicate logic,Machine learning | Conference | 6 |
PageRank | References | Authors |
1.20 | 7 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| G. Levi | 1 | 6 | 1.20 |
| F. Sirovich | 2 | 11 | 1.86 |