Sciweavers

725 search results - page 81 / 145
» Complexity of Computing with Extended Propositional Logic Pr...
Sort
View
PLPV
2009
ACM
16 years 3 months ago
Positively dependent types
This paper is part of a line of work on using the logical techniques of polarity and focusing to design a dependent programming language, with particular emphasis on programming w...
Daniel R. Licata, Robert Harper
ECP
1997
Springer
102views Robotics» more  ECP 1997»
15 years 10 months ago
Event Calculus Planning Revisited
In 1969 Cordell Green presented his seminal description of planning as theorem proving with the situation calculus. The most pleasing feature of Green's account was the negli...
Murray Shanahan
ACL
2004
15 years 7 months ago
Balancing Clarity and Efficiency in Typed Feature Logic Through Delaying
The purpose of this paper is to re-examine the balance between clarity and efficiency in HPSG design, with particular reference to the design decisions made in the English Resourc...
Gerald Penn
ACMICEC
2003
ACM
172views ECommerce» more  ACMICEC 2003»
15 years 11 months ago
Automated mechanism design: complexity results stemming from the single-agent setting
The aggregation of conflicting preferences is a central problem in multiagent systems. The key difficulty is that the agents may report their preferences insincerely. Mechanism ...
Vincent Conitzer, Tuomas Sandholm
ICCS
2009
Springer
16 years 21 days ago
Conceptual Graph Rules and Equivalent Rules: A Synthesis
This paper is an extended abstract of the talk given at ICCS’09. Rules have long been considered as an essential component of knowledge-based systems. We focus here on conceptual...
Marie-Laure Mugnier