http://www.cs.toronto.edu/cogrobo/main University of Toronto Tue, 10 Jul 2007 16:29:55 +0000 http://backend.userland.com/rss092 en Date: Thursday, July 12th, 2007 Time: 11-12pm Room: PT 378 Using More Reasoning To Improve #SAT Solving Jessica Davies and Fahiem Bacchus Abstract Many real-world problems, including inference in Bayes Nets, can be reduced to #SAT, the problem of counting the number of models of a propositional theory. This has motivated the need for efficient #SAT ... http://www.cs.toronto.edu/cogrobo/main/archives/22.html Date: Friday, July 6th, 2007 Time: 10-11am Room: PT 378 A Situation-Calculus Semantics for an Expressive Fragment of PDDL by Yuxiao Hu Abstract The Planning Domain Definition Language (PDDL) has become a common language to specify planning problems, facilitating the formulation of benchmarks and a direction comparison of planners. Over the years PDDL has been ... http://www.cs.toronto.edu/cogrobo/main/archives/20.html Date: Thursday, July 5th Time: 11-12pm Room: PT266 Using Expectation Maximization to Find Likely Assignments for Constraint Satisfaction Problems by Eric Hsu, Matthew Kitching, Fahiem Bacchus, Sheila McIlraith (Speaker: Eric Hsu) A Logical Theory of Coordination and Joint Ability by Hojjat Ghaderi Using Expectation Maximization to Find Likely Assignments for Constraint Satisfaction Problems by Eric Hsu, Matthew ... http://www.cs.toronto.edu/cogrobo/main/archives/19.html Date: Friday, May 18th Time: 3-4pm Room: PT266 Abstract Logical Filtering is the combination of two tasks: (a) Filter: Determine (represent in some way) the set of possible states (belief state) of a dynamic system at some time t, given previous observations and a belief state at time 0; and (b) ... http://www.cs.toronto.edu/cogrobo/main/archives/18.html Date : Friday, April 20th 2007 Time : 3-4pm Room : PT 266 Abstract Classen et al recently defined a declarative semantics for the ADL subset of PDDL. We extend their result to include the temporal features in PDDL 2.x, such as durative actions and concurrency, among other things. Unlike the existing state-transitional ... http://www.cs.toronto.edu/cogrobo/main/archives/17.html Date : Friday, March 16th 2007 Time : 3-4pm Room : PT 266 Abstract A team of agents is jointly able to achieve a goal if despite any incomplete knowledge they may have about the world or each other, they still know enough to be able to get to a goal state.Unlike in ... http://www.cs.toronto.edu/cogrobo/main/archives/16.html Date : Friday, March 9th 2007 Time : 3-4pm Room : PT 266 Abstract The action language Golog has been applied successfully to the control of robots, among other things. Perhaps the greatest advantage of the language is that a user can write programs which constrain the search for an executable plan in ... http://www.cs.toronto.edu/cogrobo/main/archives/15.html Date : Friday, February 23 2007 Time : 3-4pm Room : PT 266 Abstract Checkers for propositional satisfiability (SAT solvers) are the most effective tools for solving important classes of industrial-scale problems (in computer-aided design of integrated circuits, planning, model checking, scheduling, cryptography, ...). One step "ahead" of SAT solvers, we encounter QBF ... http://www.cs.toronto.edu/cogrobo/main/archives/14.html Indigolog is currently in “alpha” stage. You can download the latest version (linux-0.5alpha1) from the Systems page or by clicking here. http://www.cs.toronto.edu/cogrobo/main/archives/13.html Date : Friday, January 26, 2007 Time : 3-4pm Room : PT 266 Abstract: In this talk I present two approaches for knowledge assimilation from vision data: the first includes a novel logic-based formalism for representing knowledge about objects in space and their movements (including the observer). In this framework space is represented using functions that extract ... http://www.cs.toronto.edu/cogrobo/main/archives/12.html