Sciweavers

454 search results - page 12 / 91
» Representation results for defeasible logic
Sort
View
AAMAS
2008
Springer
13 years 8 months ago
Dynamic intention structures I: a theory of intention representation
This article introduces a new theory of intention representation which is based1 on a structure called a Dynamic Intention Structure (DIS). The theory of DISs was motivated2 by the...
Luke Hunsberger, Charles L. Ortiz Jr.
IPPS
2003
IEEE
14 years 1 months ago
Evolutionary Fault Recovery in a Virtex FPGA Using a Representation that Incorporates Routing
Most evolutionary approaches to fault recovery in FPGAs focus on evolving alternative logic configurations as opposed to evolving the intra-cell routing. Since the majority of tra...
Jason D. Lohn, Gregory V. Larchev, Ronald F. DeMar...
CADE
2012
Springer
11 years 11 months ago
EPR-Based Bounded Model Checking at Word Level
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
Moshe Emmer, Zurab Khasidashvili, Konstantin Korov...
JCT
2006
110views more  JCT 2006»
13 years 8 months ago
Branch-width, parse trees, and monadic second-order logic for matroids
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
Petr Hlinený
AMAI
2007
Springer
13 years 8 months ago
Automated theorem proving by resolution in non-classical logics
This paper is an overview of a variety of results, all centered around a common theme, namely embedding of non-classical logics into first order logic and resolution theorem prov...
Viorica Sofronie-Stokkermans