Constraint-based grammar formalisms: parsing and type inference for natural and computer languages
Constraint-based grammar formalisms: parsing and type inference for natural and computer languages
Pattern languages of program design
Pattern languages of program design
An efficient context-free parsing algorithm
Communications of the ACM
Preference logic grammars: fixed point semantics and application to data standardization
Artificial Intelligence
Tabling for non-monotonic programming
Annals of Mathematics and Artificial Intelligence
Place or Transition Petri Nets
Lectures on Petri Nets I: Basic Models, Advances in Petri Nets, the volumes are based on the Advanced Course on Petri Nets
Efficient Model Checking Using Tabled Resolution
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Constraint-based analysis of security properties
Constraint-based analysis of security properties
Xcellog: A deductive spreadsheet system
The Knowledge Engineering Review
Layered Models Top-Down Querying of Normal Logic Programs
PADL '09 Proceedings of the 11th International Symposium on Practical Aspects of Declarative Languages
OpenRuleBench: an analysis of the performance of rule engines
Proceedings of the 18th international conference on World wide web
Logic Programming with Defaults and Argumentation Theories
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Demand-driven indexing of prolog clauses
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Elder care via intention recognition and evolution prospection
INAP'09 Proceedings of the 18th international conference on Applications of declarative programming and knowledge management
Prospective storytelling agents
PADL'10 Proceedings of the 12th international conference on Practical Aspects of Declarative Languages
Computer Languages
Efficient tabling of structured data using indexing and program transformation
PADL'12 Proceedings of the 14th international conference on Practical Aspects of Declarative Languages
| Hi-index | 0.00 |
The use of design patterns is common in many areas of software engineering and programming. While they are informal, patterns provide a repository of solutions to common problems, as well as a survey of the features of a given language or software system. This paper uses design patterns to survey features and applications of Tabled Logic Programming (TLP). Patterns for commonly available features are presented, such as those of various recursion types that arise when tabling is used with definite programs, of automatic tabling and of tabling with DCGs. In addition, various patterns capture well-developed uses of tabled negation for non-monotonic reasoning. A final set of patterns describes the approaches of answer subsumption and tabled constraints, features that have fewer applications to date due to the fact that robust implementations of them have only recently become available.