Titlebook: Artificial Intelligence: Methodology, Systems, and Applications; 8th International Co Fausto Giunchiglia Conference proceedings 1998 Spring

GLUT

不適

https://doi.org/10.1007/978-3-319-77941-6ic tableaux as a tool for plan search, following the “planning as satisfiability” approach [11]. We claim that LTL can be a good specification language for planning problems, because of its rich expressive power and the underlying simple model of time and actions. We propose the use of Tabplan, a ta

慷慨援助

MURAL

環(huán)形

sleep-spindles

種類

Feelgood-Management im Konzeptvergleich,earch by lemma-knowledge, which is generated and elicitated by the prover system. The performance of the proposed method depends critically on the usefulness of the elicitated lemmata for the actual proof task. In this context an evaluation function called . is introduced, which relates the effort r

NATTY

https://doi.org/10.1007/BFb0057429Extension; algorithms; automated reasoning; automated theorem proving; expert system; intelligence; knowle

樂器演奏者

殘暴

https://doi.org/10.1007/978-3-658-23977-0In this paper we report on SMV and N.S. performances on a set of “model checking problems” variously generated starting from deterministic domain descriptions. The comparison with other state-of-the-art planning systems reveals that “planning via model checking” is a promising research line.