Sciweavers

4401 search results - page 86 / 881
» Computing with Default Logic
Sort
View
IBERAMIA
2010
Springer
13 years 6 months ago
A Computational Method for Defeasible Argumentation Based on a Recursive Warrant Semantics
In a recent paper [2] the authors have formalized a recursive semantics for warranted conclusions in a general defeasible argumentation framework based on a propositional logic. Th...
Teresa Alsinet, Ramón Béjar, Lluis G...
AHS
2007
IEEE
263views Hardware» more  AHS 2007»
14 years 3 months ago
Programming an FPGA-based Super Computer Using a C-to-VHDL Compiler: DIME-C
Since their invention in the 1980s, the logic density of FPGAs has increased exponentially with time. This increase of logic density first led to the development of synthesisable ...
Gildas Genest, Richard Chamberlain, Robin J. Bruce
LOGCOM
2006
82views more  LOGCOM 2006»
13 years 8 months ago
Embedding Alternating-time Temporal Logic in Strategic STIT Logic of Agency
Seeing To It That (STIT) logic is a logic of agency, proposed in the 1990s in the domain of philosophy of action. It is the logic of constructions of the form `agent a sees to it ...
Jan Broersen, Andreas Herzig, Nicolas Troquard
BIRTHDAY
2004
Springer
14 years 2 months ago
Pure Type Systems in Rewriting Logic: Specifying Typed Higher-Order Languages in a First-Order Logical Framework
Abstract. The logical and operational aspects of rewriting logic as a logical framework are tested and illustrated in detail by representing pure type systems as object logics. Mor...
Mark-Oliver Stehr, José Meseguer
FPGA
1997
ACM
145views FPGA» more  FPGA 1997»
14 years 29 days ago
Generation of Synthetic Sequential Benchmark Circuits
Programmable logic architectures increase in capacity before commercial circuits are designed for them, yielding a distinct problem for FPGA vendors: how to test and evaluate the ...
Michael D. Hutton, Jonathan Rose, Derek G. Corneil