Sciweavers

163 search results - page 17 / 33
» Higher-Order Logic and Theorem Proving for Structured Specif...
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 4 months ago
Schaefer's theorem for graphs
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
Manuel Bodirsky, Michael Pinsker
ECAI
2004
Springer
14 years 28 days ago
Guiding a Theorem Prover with Soft Constraints
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
John K. Slaney, Arnold Binas, David Price
ICAIL
2003
ACM
14 years 23 days ago
Specifying and Reasoning with Institutional Agents
This paper proposes a logic-oriented framework for institutional agents specification and analysis. Within this framework institutional agents are seen as artificial agents that a...
Filipe Santos, Olga Pacheco
ENTCS
2007
107views more  ENTCS 2007»
13 years 7 months ago
Event Domains, Stable Functions and Proof-Nets
We pursue the program of exposing the intrinsic mathematical structure of the “space of proofs” of a logical system [AJ94b]. We study the case of Multiplicative-Additive Linea...
Samson Abramsky
MKM
2007
Springer
14 years 1 months ago
Context Aware Calculation and Deduction
We address some aspects of a proposed system architecture for mathematical assistants, integrating calculations and deductions by common infrastructure within the Isabelle theorem ...
Amine Chaieb, Makarius Wenzel