Sciweavers

1688 search results - page 173 / 338
» The Complexity of Rationalizing Matchings
Sort
View
CSCLP
2008
Springer
15 years 7 months ago
An Efficient Decision Procedure for Functional Decomposable Theories Based on Dual Constraints
Abstract. Over the last decade, first-order constraints have been efficiently used in the artificial intelligence world to model many kinds of complex problems such as: scheduling,...
Khalil Djelloul
CASCON
2007
1035views Education» more  CASCON 2007»
15 years 7 months ago
An IDE for software development using tabular expressions
We present preliminary work on an IDE for formal software development using tabular expressions as the basis for precise specifications and descriptions of software behaviour. 1 ...
Dennis K. Peters, Mark Lawford, Baltasar Tranc&oac...
CLIMA
2004
15 years 7 months ago
Weighted Multi Dimensional Logic Programs
Abstract. We introduce a logical framework suitable to formalize structures of epistemic agents. Such a framework is based on the notion of weighted directed acyclic graphs (WDAGs)...
Pierangelo Dell'Acqua
AAAI
2000
15 years 7 months ago
RealPlan: Decoupling Causal and Resource Reasoning in Planning
Recent work has demonstrated that treating resource reasoning separately from causal reasoning can lead to improved planning performance and rational resource management where inc...
Biplav Srivastava
IJCAI
1993
15 years 7 months ago
A Model-Theoretic Approach to the Verification of Situated Reasoning Systems
agent-oriented system. We show the complexity to be linear time for one of these logics and polynomial time for another, thus providing encouraging results with respect to the prac...
Anand S. Rao, Michael P. Georgeff