Sciweavers

600 search results - page 12 / 120
» An Extended Interpreted System Model for Epistemic Logics
Sort
View
AGP
2003
IEEE
15 years 3 months ago
Transforming co-NP Checks to Answer Set Computation by Meta-Interpretation
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
Thomas Eiter, Axel Polleres
LFCS
1992
Springer
15 years 1 months ago
Denotations for Classical Proofs - Preliminary Results
This paper addresses the problem of extending the formulae-as-types principle to classical logic. More precisely, we introduce a typed lambda-calculus (-LK ) whose inhabited types...
Philippe de Groote
NMR
2004
Springer
15 years 3 months ago
Adding modal operators to the action language A
The action language A is a simple high-level language for describing transition systems. In this paper, we extend the action language A by allowing a unary modal operator in the u...
Aaron Hunter
LFCS
2009
Springer
15 years 4 months ago
Completeness Results for Memory Logics
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structure...
Carlos Areces, Santiago Figueira, Sergio Mera
ICVS
2003
Springer
15 years 2 months ago
Navigating through Logic-Based Scene Models for High-Level Scene Interpretations
This paper explores high-level scene interpretation with logic-based conceptual models. The main interest is in aggregates which describe interesting co-occurrences of physical obj...
Bernd Neumann, Thomas Weiss