Results 1  10
of
3,966
A Decidable Logic for Describing Linked Data Structures
 In ESOP '99: European Symposium on Programming
, 1999
"... . This paper aims to provide a better formalism for describing properties of linked data structures (e.g., lists, trees, graphs), as well as the intermediate states that arise when such structures are destructively updated. The paper defines a new logic that is suitable for these purposes (called Lr ..."
Abstract

Cited by 37 (7 self)
 Add to MetaCart
Lr , for "logic of reachability expressions"). We show that Lr is decidable, and explain how Lr relates to two previously defined structuredescription formalisms ("path matrices" and "static shape graphs") by showing how an arbitrary shape descriptor from each
Decidable logics combining heap structures and data
 IN: POPL’11
, 2011
"... We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data ” logic) formulas express constraints involving heap structures and the data they contain; they are defined over a class of pointerstru ..."
Abstract

Cited by 26 (9 self)
 Add to MetaCart
We define a new logic, STRAND, that allows reasoning with heapmanipulating programs using deductive verification and SMT solvers. STRAND logic (“STRucture ANd Data ” logic) formulas express constraints involving heap structures and the data they contain; they are defined over a class of pointer
A Complete and Decidable Logic for ResourceBounded Agents
 in Proceedings of the Third International Joint Conference on Autonomous Agents and MultiAgent Systems (AAMAS 2004
, 2004
"... We propose a contextlogic style formalism, Timed Reasoning Logics (TRL), to describe resourcebounded reasoners who take time to derive consequences of their knowledge. The semantics of TRL is grounded in the agent's computation, allowing an unambiguous ascription of the set of formulas which ..."
Abstract

Cited by 22 (8 self)
 Add to MetaCart
We propose a contextlogic style formalism, Timed Reasoning Logics (TRL), to describe resourcebounded reasoners who take time to derive consequences of their knowledge. The semantics of TRL is grounded in the agent's computation, allowing an unambiguous ascription of the set of formulas which
Towards an expressive decidable logical action theory
 In: Proc. of the 25th Int. Workshop on Description Logics (DL2012) (2012
"... The projection problem is an important reasoning task in AI. It is a prerequisite to solving other computational problems including planning and highlevel program execution. Informally, the projection problem consists in finding whether a given logical formula is true in a state that results from a ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
The projection problem is an important reasoning task in AI. It is a prerequisite to solving other computational problems including planning and highlevel program execution. Informally, the projection problem consists in finding whether a given logical formula is true in a state that results from
A decidable logic for time intervals: Propositional neighborhood logic
 Proc. of the AAAI2002 Workshop on Spatial and Temporal Reasoning
, 2002
"... Logics for time intervals provide a natural framework for representing and reasoning about timing properties in various areas of artificial intelligence and computer science. Unfortunately, most time interval logics proposed in the literature are (highly) undecidable. Decidable fragments of these ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Logics for time intervals provide a natural framework for representing and reasoning about timing properties in various areas of artificial intelligence and computer science. Unfortunately, most time interval logics proposed in the literature are (highly) undecidable. Decidable fragments
A Complete and Decidable Logic for Reasoning about Action Types and Action Capabilities
, 2009
"... There has been recently an intense interest on reasoning issues about semantic web services discovery and composability. Some of the requirements arising in this context are that (semantic web) services (desired to achieve some goal) should be discoverable given the information contained in their pr ..."
Abstract
 Add to MetaCart
this initial motivation, we proceed in this report to the presentation of a logical system that can meet these requirements and that is shown to be complete and decidable. The main technical results of the present work relate to (a) presenting the logic in a Gentzenstyle proof system and a semantic proof
Yago: A Core of Semantic Knowledge
 IN PROC. OF WWW ’07
, 2007
"... We present YAGO, a lightweight and extensible ontology with high coverage and quality. YAGO builds on entities and relations and currently contains roughly 900,000 entities and 5,000,000 facts. This includes the IsA hierarchy as well as nontaxonomic relations between entities (such as hasWonPrize ..."
Abstract

Cited by 504 (66 self)
 Add to MetaCart
persons, organizations, products, etc. with their semantic relationships – and in quantity by increasing the number of facts by more than an order of magnitude. Our empirical evaluation of fact correctness shows an accuracy of about 95%. YAGO is based on a logically clean model, which is decidable
The DLV System for Knowledge Representation and Reasoning
 ACM Transactions on Computational Logic
, 2002
"... Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely believ ..."
Abstract

Cited by 456 (102 self)
 Add to MetaCart
Disjunctive Logic Programming (DLP) is an advanced formalism for knowledge representation and reasoning, which is very expressive in a precise mathematical sense: it allows to express every property of finite structures that is decidable in the complexity class ΣP 2 (NPNP). Thus, under widely
Specifying Timed State Sequences in Powerful Decidable Logics and Timed Automata (Extended Abstract)
 LNCS 863
, 1994
"... ) Thomas Wilke ChristianAlbrechtsUniversitat zu Kiel, Institut fur Informatik und Praktische Mathematik, D24098 Kiel, Germany ? Abstract. A monadic secondorder language, denoted by Ld, is introduced for the specification of sets of timed state sequences. A fragment of Ld, denoted by L $ d, is ..."
Abstract

Cited by 55 (0 self)
 Add to MetaCart
, is proved to be expressively complete for timed automata (Alur and Dill), i. e., every timed regular language is definable by a L $ dformula and every L $ dformula defines a timed regular language. As a consequence the satisfiability problem for L $ d is decidable. Timed temporal logics are shown
Results 1  10
of
3,966