A5060460434- Multi-Agent Systems and Negotiation
- Logic, Reasoning, and Knowledge
- Semantic Web and Ontologies
- AI-based Problem Solving and Planning
- Business Process Modeling and Analysis
- Logic, programming, and type systems
- Formal Methods in Verification
- Service-Oriented Architecture and Web Services
- Advanced Software Engineering Methodologies
- Constraint Satisfaction and Optimization
- Robotics and Sensor-Based Localization
- Auction Theory and Applications
- Advanced Vision and Imaging
- Manufacturing Process and Optimization
- Natural Language Processing Techniques
- Robotics and Automated Systems
- Bayesian Modeling and Causal Inference
- Simulation Techniques and Applications
- Model-Driven Software Engineering Techniques
- Mobile Agent-Based Network Management
- Advanced Database Systems and Queries
- CCD and CMOS Imaging Sensors
- Robotic Path Planning Algorithms
- Game Theory and Applications
- Artificial Intelligence in Games
York University
2013-2024
University of Toronto
1986-1997
Stanford University
1986
Most models fail to capture the rationale behind processes, making business reengineering less effective. The authors describe their I* framework, which views organizations as collections of actors with strategic interests, and interdependencies involving goals, tasks, resources. discuss ConGolog supports reasoning about dynamics processes under incomplete knowledge.
Reasoning about the causes behind observations is crucial to formalization of rationality. While extensive research has been conducted on root cause analysis, most studies have predominantly focused deterministic settings. In this paper, we investigate causation in more realistic nondeterministic domains, where agent does not any control and may know choices that are made by environment. We build recent preliminary work actual situation calculus formalize sophisticated forms reasoning such...
We present a new formal framework for generalized planning (GP) based on the situation calculus extended with LTL constraints. The GP problem is specified by first-order basic action theory whose models are instances. This low-level then abstracted into high-level propositional nondeterministic single model. A refinement mapping relates two theories. formulas used to specify temporally goals as well assumed trace If all constraints hold at low level and model can simulate respect mapping, we...
The Cognitive Agents Specification Language (CASL) is a frame-work for specifying multiagent systems. It has mix of declarative and procedural components to facilitate the specification verification complex In this paper, we describe CASL environment (CASLve) it based on PVS system. We give an example meeting scheduler application specified with CASL. To illustrate system, discuss proof carried out in it, namely, that all bounded-loop specifications terminate.
We develop a general framework for agent abstraction based on the situation calculus and ConGolog programming language. assume that we have high-level specification low-level of agent, both represented as basic action theories. A refinement mapping specifies how each is implemented by program fluent can be translated into formula. define notion sound between such theories in terms existence suitable bisimulation their respective models. Sound abstractions many useful properties ensure reason...