| Author/Editor [Non Institute] | Year | | Title | Type |
|---|
van der Torre
(Ed: Dix, Fariñas del Cerro, Furbach)
[-] | 1998 | | Phased labeled logics of conditional goals
In: Proceedings of the 6th European Workshop on Logics in AI: Logics in Artificial Intelligence (JELIA-98), 92-106 | Proceedings Article |
van der Torre
(Ed: Hunter, Parsons)
[Hunter, Parsons] | 1999 | | Defeasible Goals
In: Proceedings of the 5th European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty (ECSQARU-99), 374-385 | Proceedings Article |
van der Torre
(Ed: Prade)
[-] | 1998 | | Labeled logics of conditional goals
In: Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), 368-369 | Proceedings Article |
van der Torre, Tan
(Ed: Brewka, Habel, Nebel)
[Tan] | 1997 | | Reasoning about exceptions
In: Proceedings of the 21st Annual German Conference on Artificial Intelligence (KI-97): Advances in Artificial Intelligence, 405-408 | Proceedings Article |
van der Torre, Tan
(Ed: Cavalcanti)
[Tan, Cavalcanti] | 1999 | | Contextual Deontic Logic: violation contexts and factual defeasibility
In: Formal Aspects in Context, 173-192 | Part of a Book |
van der Torre, Tan
(Ed: Dix, Fariñas del Cerro, Furbach)
[Tan] | 1998 | | Prohairetic Deontic Logic (PDL)
In: Proceedings of the 6th European Workshop on Logics in AI: Logics in Artificial Intelligence (JELIA-98), 77-91 | Proceedings Article |
van der Torre, Tan
(Ed: Laskey, Prade)
[Tan, Laskey, Prade] | 1999 | | An Update Semantics for Defeasible Obligations
In: Proceedings of the 15th Conference on Uncertainty in Artificial Intelligence (UAI-99), 631-638 | Proceedings Article |
van der Torre, Tan
(Ed: McNamara, Prakken)
[Tan, McNamara, Prakken] | 1999 | | An update semantics for deontic reasoning
In: Norms, Logics and Information Systems: New Studies on Deontic Logic and Computer Science, 73-90 | Part of a Book |
van der Torre, Tan
(Ed: Prade)
[Tan] | 1998 | | An update semantics for prima facie obligations
In: Proceedings of the 13th European Conference on Artificial Intelligence (ECAI-98), 38-42 | Proceedings Article |
van der Torre, Tan
[Tan] | 1999 | | Contrary-to-duty reasoning with preference-based dyadic obligations
In: Annals of Mathematics and Artificial Intelligence [27], 49-78 | Journal Article |
van der Torre, Tan
[Tan] | 1999 | | Diagnosis and Decision Making in Normative Reasoning
In: Journal of Artificial Intelligence and Law [7], 51-67 | Journal Article |
van der Torre, Tan
[Tan] | 1999 | | Rights, Duties and Commitments Between Agents
In: Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), 1239-1244 | Proceedings Article |
van der Torre, Tan
[Tan] | 1998 | | The temporal analysis of Chisholm's paradox
In: Proceedings of the 15th National Conference, and 10th Conference on Innovative Applications of Artificial Intelligence (AAAI-98) and (IAAI-98), 650-655 | Proceedings Article |
van der Torre, Tan
[Tan] | 1997 | | Distinguishing different roles in normative reasoning
In: Proceedings of the 6th International Conference on Artificial Intelligence and Law (ICAIL-97), 225-232 | Proceedings Article |
van der Torre, Weydert
[van der Torre] | 2001 | | Parameters for Utilitarian Desires in a Qualitative Decision Theory
In: Applied Artificial Intelligence [14], 285-301 | Journal Article |
Veanes
(Ed: Pratt)
[-] | 1998 | | The Relation Between Second-Order Unification and Simultaneous Rigid E-Unification
In: Proceedings of the 13th Annual IEEE Symposium on Logic in Computer Science (LICS-98), 264-275 | Proceedings Article |
Veanes
[-] | 2000 | | Farmer's Theorem Revisited
In: Information Processing Letters [74], 47-53 | Journal Article |
Veit
[-] | 1999 | | Formal Fairness Proofs for Optimistic Contract Signing Protocols
Universität des Saarlandes | Thesis - Masters thesis |
Viganò
[-] | 1997 | | A Framework for Non-Classical Logics
Universität des Saarlandes | Thesis - PhD thesis |
Vorobyov
(Ed: Brim, Gruska, Zlatuska)
[-] | 1998 |  | $\forall\exists^\ast$-Equational Theory of Context Unification is $\Pi_1^0$-Hard
In: Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science (MFCS-98), 597-606 | Proceedings Article |
Vorobyov
(Ed: Comon)
[Comon] | 1997 | | The first-order theory of one step rewriting in linear noetherian systems is undecidable
In: Proceedings of the 8th International Conference on Rewriting Techniques and Applications (RTA-97), 254-268 | Proceedings Article |
Vorobyov
(Ed: Gottlob, Grandjean, Seyr)
[Gottlob, Grandjean, Seyr] | 1999 | | Subtyping Functional+Nonempty Record Types
In: Proceedings of the 12th International Workshop on Computer Science Logic (CSL-98), Annual Conference on the EACSL, 285-297 | Proceedings Article |
Vorobyov
(Ed: Jaffar, Yap)
[Jaffar, Yap] | 1996 | | On the bounded theories of finite trees
In: Second Asian Computing Science Conference, ASIAN'96, 152-161 | Proceedings Article |
Vorobyov
(Ed: McRobbie, Slaney)
[McRobbie, Slaney] | 1996 | | An improved lower bound for the elementary theories of trees
In: Proceedings of the 13th International Conference on Automated Deduction (CADE-13), 275-287 | Proceedings Article |
Vorobyov
(Ed: Winskel)
[Winskel] | 1997 | | The `hardest´ natural decidable theory
In: Proceedings of the Twelfth Annual IEEE Symposium on Logic in Computer Science (LICS-97), 294-305 | Proceedings Article |
Vorobyov
[-] | 2002 | | The undecidability of the first-order theories of one step rewriting in linear canonical systems
In: Information and Computation [175], 182-213 | Journal Article |
Vorobyov
[-] | 2002 | | $\forall\exists^5$-equational theory of context unification is undecidable
In: Theoretical Computer Science [275], 463-479 | Journal Article |
Vorobyov
[-] | 1995 | | Fsub with recursive types: `Types-As-Propositions´ Interpretations in M. Rabin's S2S
In: Proceedings of JFLA'95: Journées Francophones des Langages Applicatifs (JFLA'95), 49-73 | Proceedings Article |
Vorobyov
[-] | 1995 | | Structural decidable extensions of bounded quantification
In: Proceedings of the 22nd ACM Symposium on Principles of Programming Languages (POPL'95), 164-175 | Proceedings Article |
Vorobyov, Voronkov
[-] | 1998 | | Complexity of Nonrecursive Logic Programs with Complex Values
In: Proceedings of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-98), 244-253 | Proceedings Article |
