Sciweavers

536 search results - page 40 / 108
» From Formal Concept Analysis to Contextual Logic
Sort
View
CIE
2005
Springer
15 years 11 months ago
Towards Computability of Higher Type Continuous Data
Abstract. This paper extends the logical approach to computable analysis via Σ–definability to higher type continuous data such as functionals and operators. We employ definab...
Margarita V. Korovina, Oleg V. Kudinov
CADE
1998
Springer
15 years 10 months ago
A Combination of Nonstandard Analysis and Geometry Theorem Proving, with Application to Newton's Principia
Abstract. The theorem prover Isabelle is used to formalise and reproduce some of the styles of reasoning used by Newton in his Principia. The Principia's reasoning is resolute...
Jacques D. Fleuriot, Lawrence C. Paulson
SLOGICA
2002
74views more  SLOGICA 2002»
15 years 5 months ago
Transfers between Logics and their Applications
In this paper, logics are conceived as two-sorted first-order structures, and we argue that this broad definition encompasses a wide class of logics with theoretical interest as w...
Marcelo E. Coniglio, Walter Alexandre Carnielli
TMC
2012
13 years 8 months ago
Protecting Location Privacy in Sensor Networks against a Global Eavesdropper
— While many protocols for sensor network security provide confidentiality for the content of messages, contextual information usually remains exposed. Such information can be c...
Kiran Mehta, Donggang Liu, Matthew Wright
NMR
2004
Springer
15 years 11 months ago
Semantics of disjunctive programs with monotone aggregates - an operator-based approach
All major semantics of normal logic programs and normal logic programs with aggregates can be described as fixpoints of the one-step provability operator or of operators that can...
Nikolay Pelov, Miroslaw Truszczynski