Sciweavers

4573 search results - page 292 / 915
» Automated Reasoning
Sort
View
KR
2000
Springer
15 years 10 months ago
Finding Admissible and Preferred Arguments Can be Very Hard
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
153
Voted
LICS
2002
IEEE
15 years 11 months ago
Separation Logic: A Logic for Shared Mutable Data Structures
In joint work with Peter O’Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that permits reasoning about low-level imperative pr...
John C. Reynolds
TPHOL
2002
IEEE
15 years 11 months ago
A Proposal for a Formal OCL Semantics in Isabelle/HOL
Abstract We present a formal semantics as a conservative shallow embedding of the Object Constraint Language (OCL). OCL is currently under development within an open standardizatio...
Achim D. Brucker, Burkhart Wolff
KR
2010
Springer
15 years 11 months ago
Interpreting Topological Logics over Euclidean Spaces
Topological logics are a family of languages for representing and reasoning about topological data. In this paper, we consider propositional topological logics able to express the...
Roman Kontchakov, Ian Pratt-Hartmann, Michael Zakh...
ASP
2001
Springer
15 years 11 months ago
Logic Programming Agents and Game Theory
In this paper we present a framework for logic programming agents to take part in games in such a way that stable models of the system, the ones agreed upon by all the members, co...
Marina De Vos, Dirk Vermeir