Sciweavers

206 search results - page 17 / 42
» Specification and Complexity of Strategic-Based Reasoning Us...
Sort
View
CAV
2006
Springer
128views Hardware» more  CAV 2006»
15 years 3 months ago
Safraless Compositional Synthesis
In automated synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. In spite of the rich theory developed for system synthesis, litt...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
90
Voted
LPNMR
2009
Springer
15 years 4 months ago
Manifold Answer-Set Programs for Meta-reasoning
Abstract. In answer-set programming (ASP), the main focus usually is on computing answer sets which correspond to solutions to the problem represented by a logic program. Simple re...
Wolfgang Faber, Stefan Woltran
CADE
2001
Springer
15 years 12 months ago
More On Implicit Syntax
Proof assistants based on type theories, such as Coq and Lego, allow users to omit subterms on input that can be inferred automatically. While those mechanisms are well known, ad-h...
Marko Luther
98
Voted
CBMS
2007
IEEE
15 years 6 months ago
Managing Conceptual Revisions in a Temporal Fungal Taxonomy
Representing and Reasoning about time and change is one of the primary issues in the area of Artificial Intelligence (AI) and Knowledge Representation (KR). Despite the importance...
Arash Shaban-Nejad, Volker Haarslev
AAMAS
2004
Springer
14 years 11 months ago
Temporal Development Methods for Agent-Based
In this paper we overview one specific approach to the formal development of multi-agent systems. This approach is based on the use of temporal logics to represent both the behavio...
Michael Fisher