Sciweavers

446 search results - page 71 / 90
» Automating Theories in Intuitionistic Logic
Sort
View
CSL
2005
Springer
14 years 1 months ago
Feasible Proofs of Matrix Properties with Csanky's Algorithm
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...
Michael Soltys
LICS
1992
IEEE
13 years 11 months ago
Asynchronous Communication in Process Algebra
d Abstract) Frank S. de Boer, Jan Willem Klopyz , Catuscia Palamidessiyx We study the paradigm of asynchronous process communication, as contrasted with the synchronous communicat...
Frank S. de Boer, Jan Willem Klop, Catuscia Palami...
ALP
1990
Springer
13 years 11 months ago
Equation Solving in Conditional AC-Theories
Conditional Equational Programming is an elegant way to uniformly integrate important features of functional and logic programming. Efficientmethods for equation solving are thus ...
Nachum Dershowitz, Subrata Mitra, G. Sivakumar
EWCBR
2008
Springer
13 years 9 months ago
Conservative Adaptation in Metric Spaces
Conservative adaptation consists in a minimal change on a source case to be consistent with the target case, given the domain knowledge. It has been formalised in a previous work t...
Julien Cojan, Jean Lieber
JSW
2008
105views more  JSW 2008»
13 years 7 months ago
Reasoning Principles for Negotiating Agent
Automated negotiation is an important applying field of agent theory and technology. For the current agent theoretical models have some troubles in explaining the agent's nego...
Mukun Cao, Yuqiang Feng