Sciweavers

746 search results - page 137 / 150
» Connectionist Propositional Logic
Sort
View
CORR
2010
Springer
194views Education» more  CORR 2010»
14 years 7 months ago
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems
Basic proof search tactics in logic and type theory can be seen as the root-rst applications of rules in an appropriate sequent calculus, preferably without the redundancies gener...
Stéphane Lengrand, Roy Dyckhoff, James McKi...
LICS
2008
IEEE
15 years 4 months ago
On the Asymptotic Nullstellensatz and Polynomial Calculus Proof Complexity
We show that the asymptotic complexity of uniformly generated (expressible in First-Order (FO) logic) propositional tautologies for the Nullstellensatz proof system (NS) as well a...
Søren Riis
ATAL
1995
Springer
15 years 1 months ago
Formalising Motivational Attitudes of Agents
In this paper we present a formalisation of motivational attitudes, the attitudes that are the driving forces behind the actions of agents. We consider the statics of these attitu...
Bernd van Linder, Wiebe van der Hoek, John-Jules C...
SIGSOFT
2007
ACM
15 years 10 months ago
A specification-based approach to testing software product lines
This paper presents a specification-based approach for systematic testing of products from a software product line. Our approach uses specifications given as formulas in Alloy, a ...
Engin Uzuncaova, Daniel Garcia, Sarfraz Khurshid, ...
CADE
2007
Springer
15 years 10 months ago
Dependency Pairs for Rewriting with Non-free Constructors
Abstract. A method based on dependency pairs for showing termination of functional programs on data structures generated by constructors with relations is proposed. A functional pr...
Stephan Falke, Deepak Kapur