3053 search results - page 93 / 611 » A Logic of Abstract Argumentation |
166
click to vote
IANDC
2008
15 years 6 months ago
2008
act Interpretation Francesco Ranzato and Francesco Tapparo Dipartimento di Matematica Pura ed Applicata, Universit`a di Padova, Italy The Paige and Tarjan algorithm (PT) for comp...
193
click to vote
ACMICEC
2005
ACM
16 years 4 hour ago
2005
ACM
In order to capture the full fledge semantic of complicated product data model, the expressive language ALCNHR+ K(D) is introduced. It cannot only be able to represent knowledge a...
158
click to vote
EKAW
2000
Springer
15 years 10 months ago
2000
Springer
Designing a terminological knowledge base consists in collecting terms and associating them to their definition. Our objective is to define a process model to support this design ...
136
click to vote
ENTCS
2007
15 years 6 months ago
2007
Often debates about pros and cons of various techniques for formalising lambda-calculi rely on subjective arguments, such as de Bruijn indices are hard to read for humans or nomin...
161
click to vote
LPAR
2010
Springer
15 years 4 months ago
2010
Springer
Termination of recursive functions is an important property in proof assistants based on dependent type theories; it implies consistency and decidability of type checking. Type-bas...