SAT-Based Procedures for Temporal Reasoning

Author:

Armando Alessandro,Castellini Claudio,Giunchiglia Enrico

Publisher

Springer Berlin Heidelberg

Reference17 articles.

1. Allen, J., Kautz, H., Pelavin, R. (eds.): Reasoning about Plans. Morgan Kaufmann, San Francisco (1991)

2. Brusoni, V., Console, L., Pernici, B., Terenziani, P.: LaTeR: An Efficient, General Purpose Manager of Temporal Information. IEEE Software (1996)

3. Buro, M., Buning, H.: Report on a SAT competition. Technical Report 110, University of Paderborn, Germany (November 1992)

4. Cheng, C.-C., Smith, S.F.: Generating feasible schedules under complex metric constraints. In: Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI 1994), Seattle, Washington, USA, vol. 2, pp. 1086–1091. AAAI Press/MIT Press (1994)

5. Chleq, N.: Efficient algorithms for networks of quantitative temporal constraints. In: Proceedings of CONSTRAINTS 1995, April 1995, pp. 40–45 (1995)

Cited by 32 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. An interdisciplinary experimental evaluation on the disjunctive temporal problem;Constraints;2023-02-01

2. Logic programming for deliberative robotic task planning;Artificial Intelligence Review;2023-01-18

3. SMT solving for the validation of B and Event-B models;International Journal on Software Tools for Technology Transfer;2022-11-21

4. Symbolic Reasoning Methods in Rewriting Logic and Maude;Logic, Language, Information, and Computation;2018

5. An Efficient Approach for Solving Optimization over Linear Arithmetic Constraints;Journal of Computer Science and Technology;2016-09

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3