Author of the publication

A realistic (non-associative) logic and a possible explanations of 7 pm 2 law.

, , , , and . Int. J. Approx. Reason., 29 (3): 235-266 (2002)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Computational Complexity of Planning and Approximate Planning in Presence of Incompleteness., , and . IJCAI, page 948-955. Morgan Kaufmann, (1999)Computational Complexity of Planning with Temporal Goals., , and . IJCAI, page 509-514. Morgan Kaufmann, (2001)Choosing a Physical Model: Why Symmetries?, , and . Bulletin of the EATCS, (2000)Computational Complexity of Planning Based on Partial Information about the System's Present and Past States., , , and . Computational Logic, volume 1861 of Lecture Notes in Computer Science, page 882-896. Springer, (2000)Computational complexity of planning and approximate planning in the presence of incompleteness., , and . Artif. Intell., 122 (1-2): 241-267 (2000)The Role of Proximity in Willingness to Transact: The Effects of Trust and Culture., and . AMCIS, page 307. Association for Information Systems, (2007)A realistic (non-associative) logic and a possible explanations of 7 pm 2 law., , , , and . Int. J. Approx. Reason., 29 (3): 235-266 (2002)Towards Feasible Approach to Plan Checking under Probabilistic Uncertainty: Interval Methods., , and . AAAI/IAAI, page 545-550. AAAI Press / The MIT Press, (2000)Optimal interval enclosures for fractionally-linear functions, and their application to intelligent control., , and . Reliab. Comput., 2 (3): 265-285 (1996)From Planning to Searching for the Shortest Plan: An Optimal Transition., , , , , and . Int. J. Uncertain. Fuzziness Knowl. Based Syst., 9 (6): 827-837 (2001)