Sciweavers

532 search results - page 30 / 107
» The Logic of Quasi-MV Algebras
Sort
View
FSTTCS
2010
Springer
13 years 7 months ago
The Complexity of Model Checking (Collapsible) Higher-Order Pushdown Systems
We study (collapsible) higher-order pushdown systems -- theoretically robust and well-studied models of higher-order programs -- along with their natural subclass called (collapsi...
Matthew Hague, Anthony Widjaja To
CIRA
2007
IEEE
136views Robotics» more  CIRA 2007»
14 years 4 months ago
Algebraic interval constraint driven exploration in human-agent collaborative problem solving
—To enable effective human-agent collaboration, new human-centric computing paradigms are needed. This paper presents a soft constraint representation scheme based on generalized...
Yan Wang
ACL
2001
13 years 11 months ago
An Algebra for Semantic Construction in Constraint-based Grammars
We develop a framework for formalizing semantic construction within grammars expressed in typed feature structure logics, including HPSG. The approach provides an alternative to t...
Ann A. Copestake, Alex Lascarides, Dan Flickinger
AMC
2006
125views more  AMC 2006»
13 years 10 months ago
A symbolic and algebraic computation based Lambda-Boolean reduction machine via PROLOG
This paper presents a new Lambda-Boolean reduction machine for Lambda-Boolean and Lambda-Beta Boolean reductions in the context of Lambda Calculus and introduces the role of Churc...
Seref Mirasyedioglu, Tolga Güyer
LFCS
2007
Springer
14 years 4 months ago
Density Elimination and Rational Completeness for First-Order Logics
Density elimination by substitutions is introduced as a uniform method for removing applications of the Takeuti-Titani density rule from proofs in firstorder hypersequent calculi....
Agata Ciabattoni, George Metcalfe