4401 search results - page 183 / 881 » Computing with Default Logic |
131
click to vote
DAC
2006
ACM
16 years 5 months ago
2006
ACM
This paper presents a technique for preprocessing combinational logic before technology mapping. The technique is based on the representation of combinational logic using And-Inve...
170
click to vote
PLPV
2009
ACM
16 years 1 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...
141
Voted
RWEB
2009
Springer
15 years 10 months ago
2009
Springer
In this chapter we will introduce description logics, a family of logic-based knowledge representation languages that can be used to represent the terminological knowledge of an a...
156
click to vote
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
Nested words are a structured model of execution paths in procedural programs, reflecting their call and return nesting structure. Finite nested words also capture the structure ...
132
click to vote
CSL
2005
Springer
15 years 9 months ago
2005
Springer
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...