Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

AAAI
2006

favoriteEmaildiscussreport

157views Intelligent Agents» more AAAI 2006»

Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning

13 years 5 months ago

Bounded Treewidth as a Key to Tractability of Knowledge Representation and Reasoning

Download www.dbai.tuwien.ac.at

Several forms of reasoning in AI

Georg Gottlob, Reinhard Pichler, Fang Wei

Real-time Traffic

AAAI 2006 | Disjunctive Logic | Disjunctive Logic Programming | Disjunctive Logic Programs | Intelligent Agents |

claim paper

Related Content

» Tractable AnswerSet Programming with Weight Constraints Bounded Treewidth Is not Enough

» Belief Revision with Bounded Treewidth

» Pure Nash equilibria complete characterization of hard and easy graphical games

» Approximate Reasoning about Combined Knowledge

» Representations for Action Selection Learning from RealTime Observation of Task Experts

» Local closed world reasoning with description logics under the wellfounded semantics

» Reasoning with Expressive Description Logics Theory and Practice

» dRDF Entailment for DomainRestricted RDF

» Inductive Concept Retrieval and Query Answering with Semantic Knowledge Bases Through Kern...

Post Info
More Details (n/a)

Added	30 Oct 2010
Updated	30 Oct 2010
Type	Conference
Year	2006
Where	AAAI
Authors	Georg Gottlob, Reinhard Pichler, Fang Wei

Comments (0)