17054 search results - page 343 / 3411 » Logics of Dynamical Systems |
185
Voted
APAL
1999
15 years 7 months ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
169
click to vote
DAGSTUHL
2007
15 years 9 months ago
2007
A key focus of contemporary agent-oriented research and engineering is on open multiagent systems composed of truly autonomous, interacting agents. This poses new challenges, as en...
169
Voted
RULEML
2004
Springer
16 years 25 days ago
2004
Springer
Abstract. This paper describes the design and implementation of SweetProlog, a system for translating Web rules into Prolog. It enables the integration of ontologies and rules on t...
203
Voted
CADE
1999
Springer
15 years 11 months ago
1999
Springer
CutRes is a system which takes as input an LK-proof with arbitrary cuts and skolemized end-sequent and gives as output an LKproof with atomic cuts only. The elimination of cuts is ...
196
click to vote
LOPSTR
1995
Springer
15 years 11 months ago
1995
Springer
We present an automated proof method for constructive logic based on Wallen’s matrix characterization for intuitionistic validity. The proof search strategy extends Bibel’s con...