Sciweavers

2272 search results - page 205 / 455
» A Calculus for
Sort
View
ENTCS
2002
129views more  ENTCS 2002»
15 years 4 months ago
Eliminating Proofs from Programs
This paper presents a step in the development of an operational approach to program extraction in type theory. In order to get a program from a lambda term, the logical parts need...
Femke van Raamsdonk, Paula Severi
JLP
2002
90views more  JLP 2002»
15 years 4 months ago
Combining programs and state machines
State machines consume and process actions complementary to programs issuing actions. State machines maintain a state and reply with a boolean response to each action in their int...
Jan A. Bergstra, Alban Ponse
DCC
1999
IEEE
15 years 4 months ago
A General Polynomial Sieve
An important component of the index calculus methods for finding discrete logarithms is the acquisition of smooth polynomial relations. Gordon and McCurley (1992) developed a sieve...
Shuhong Gao, Jason Howell
LOGCOM
2010
88views more  LOGCOM 2010»
15 years 3 months ago
Tableaux for Public Announcement Logic
Public announcement logic extends multi-agent epistemic logic with dynamic operators to model the informational consequences of announcements to the entire group of agents. In thi...
Philippe Balbiani, Hans P. van Ditmarsch, Andreas ...
DLOG
2010
15 years 2 months ago
Paraconsistent Description Logics Revisited
Abstract. Inconsistency handling is of growing importance in Knowledge Representation since inconsistencies may frequently occur in an open world. Paraconsistent (or inconsistency-...
Norihiro Kamide