Sciweavers

71 search results - page 12 / 15
» An Abstract Way to Define Rewriting Logic
Sort
View
ECAI
2010
Springer
13 years 8 months ago
Metric Propositional Neighborhood Logics: Expressiveness, Decidability, and Undecidability
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...
Davide Bresolin, Dario Della Monica, Valentin Gora...
SIGMOD
2004
ACM
156views Database» more  SIGMOD 2004»
14 years 7 months ago
Tree Logical Classes for Efficient Evaluation of XQuery
XML is widely praised for its flexibility in allowing repeated and missing sub-elements. However, this flexibility makes it challenging to develop a bulk algebra, which typically ...
Stelios Paparizos, Yuqing Wu, Laks V. S. Lakshmana...
FOIKS
2008
Springer
13 years 9 months ago
Defeasible Reasoning and Partial Order Planning
Abstract. Argumentation-based formalisms provide a way of considering the defeasible nature of reasoning with partial and often erroneous knowledge in a given environment. This pro...
Diego R. García, Alejandro Javier Garc&iacu...
CSAC
2006
13 years 8 months ago
Toward a Pi-Calculus Based Verification Tool for Web Services Orchestrations
Abstract. Web services constitute a dynamic field of research about technologies of the Internet. WS-BPEL 2.0, is in the way for becoming a standard for defining Web services orche...
Faisal Abouzaid
CORR
2002
Springer
115views Education» more  CORR 2002»
13 years 7 months ago
Linking Makinson and Kraus-Lehmann-Magidor preferential entailments
Abstract. Twelve years ago, various notions of preferential entailment have been introduced. The main reference is a paper by Kraus, Lehmann and Magidor (KLM), one of the main comp...
Yves Moinard