Sciweavers

1391 search results - page 93 / 279
» Completeness of Neighbourhood Logic
Sort
View
AMAI
2004
Springer
14 years 28 days ago
Using Logic Programs to Reason about Infinite Sets
Using the ideas from current investigations in Knowledge Representation we study the use of a class of logic programs for reasoning about infinite sets. Those programs assert code...
Douglas A. Cenzer, V. Wiktor Marek, Jeffrey B. Rem...
ASPDAC
2001
ACM
127views Hardware» more  ASPDAC 2001»
14 years 25 days ago
High-level design for asynchronous logic
Asynchronous, self-timed, logic is often eschewed in digital design because of its ad-hoc methodologies and lack of available design tools. This paper describes a complete High Le...
Ross Smith, Michiel M. Ligthart
AAAI
2008
13 years 11 months ago
Loop Formulas for Logic Programs with Arbitrary Constraint Atoms
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...
Jia-Huai You, Guohua Liu
DLOG
2007
13 years 11 months ago
Paraconsistent Resolution for Four-valued Description Logics
Abstract. In this paper, we propose an approach to translating any ALC ontology (possible inconsistent) into a logically consistent set of disjunctive datalog rules. We achieve thi...
Yue Ma, Pascal Hitzler, Zuoquan Lin
FOSSACS
2008
Springer
13 years 10 months ago
Coalgebraic Logic and Synthesis of Mealy Machines
Abstract. We present a novel coalgebraic logic for deterministic Mealy machines that is sound, complete and expressive w.r.t. bisimulation. Every finite Mealy machine corresponds t...
Marcello M. Bonsangue, Jan J. M. M. Rutten, Alexan...