Sciweavers

3572 search results - page 26 / 715
» Nominal Logic Programming
Sort
View
ENTCS
2000
109views more  ENTCS 2000»
14 years 10 months ago
Forward and Backward Chaining in Linear Logic
Abstract. Logic programming languages based on linear logic are of both theoretical and practical interest, particulaly because such languages can be seen as providing a logical ba...
James Harland, David J. Pym, Michael Winikoff
69
Voted
EURODAC
1994
IEEE
122views VHDL» more  EURODAC 1994»
15 years 2 months ago
Compiled-code-based simulation with timing verification
Due to the complexity of today's systems, prototyping by simulation must be based on simulation-engine-like performance. It is proved by implementations that compiler-driven ...
Winfried Hahn, Andreas Hagerer, C. Herrmann
125
Voted
LFCS
2009
Springer
15 years 4 months ago
Completeness Results for Memory Logics
Memory logics are a family of modal logics in which standard relational structures are augmented with data structures and additional operations to modify and query these structure...
Carlos Areces, Santiago Figueira, Sergio Mera
78
Voted
JELIA
2004
Springer
15 years 3 months ago
The Modal Logic Programming System MProlog
Abstract. We present the design of our implemented modal logic programming system MProlog. This system is written in Prolog as a module for Prolog. Codes, libraries, and most featu...
Linh Anh Nguyen
IJAR
2008
129views more  IJAR 2008»
14 years 10 months ago
Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the trea...
Teresa Alsinet, Carlos Iván Chesñeva...