827 search results - page 131 / 166 » Proof-Theoretic Soundness and Completeness |
FTRTFT
1998
Springer
15 years 2 months ago
1998
Springer
PLC-Automata are a class of real-time automata suitable to describe the behavior of polling real-time systems. PLC-Automata can be compiled to source code for PLCs, a hardware wide...
JELIA
1998
Springer
15 years 2 months ago
1998
Springer
Abstract. One of the maincharacteristics of logical reasoning in knowledge based systems is its high computational complexity. Anytime deduction and anytime compilation are two att...
122
click to vote
ATAL
1997
Springer
15 years 2 months ago
1997
Springer
Abstract. Just as cooperation in multi-agent systems is a central issue for solving complex tasks, so too is the ability for an intelligent agent to reason about combined knowledge...
TACS
1997
Springer
15 years 1 months ago
1997
Springer
d Abstract) Alexander Aiken1 and Edward L. Wimmers2 and Jens Palsberg3 1 EECS Department, University of California at Berkeley, Berkeley, CA 94720-1776. 2 IBM Almaden Research Cent...
LPNMR
1993
Springer
15 years 1 months ago
1993
Springer
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...