12-04-2000
PHP to ASP
Hi Balaji,
Ive tried using ASP in solaris ( multi node unix server) but the chilisoft url that ive tried is corrupted.
i tried an alternative way which is convert ASP to PHP.
It worked succesfully.
4 More Discussions You Might Find Interesting
1. UNIX for Dummies Questions & Answers
I am new to Unix and would like to update a website as well as add new content to the site but it must be done with UNIX.
Can anyone give me some pointers as to what types of references are on the web or maybe even some basic commands?
Thanks so much! (1 Reply)
Discussion started by: gsensebe
1 Replies
2. UNIX for Dummies Questions & Answers
Hi there all
I am looking for both a web browser as well as a web server (Ie. Netscape Fasttrack) that will run on HPUX 10.
If you know where I can get these free via FTP, please contact me as soon as possible!!
Thanks,
Mark (1 Reply)
Discussion started by: mleathers
1 Replies
3. Shell Programming and Scripting
Hi Guru's,
I need to check the availability of a web page for every one hour through a script. Following is the requirement.
1. Go to http://vsn.srivsn.com
2. If any error encountered in openeing the home page, it should trigger an email with the appropriate error message.
3. If page opens... (6 Replies)
Discussion started by: srivsn
6 Replies
4. Shell Programming and Scripting
I need to deploy a JAVA application on two separate servers:
1. Web server (IBM HTTP Web Servers (IHS))
2. Application Server (WebSphere Application Server WAS7.0)
The static content will have to be deployed and handled on Web server. These would include GIFs, HTML, CSS, etc files.... (0 Replies)
Discussion started by: chani27
0 Replies
CLASP(1) General Commands Manual CLASP(1)
NAME
clasp - a conflict-driven nogood learning answer set solver
SYNOPSIS
clasp [number][options]
DESCRIPTION
This manual page documents briefly the clasp command.
clasp is an answer set solver for (extended) normal logic programs. It combines the high-level modeling capacities of answer set program-
ming (ASP) with state-of-the-art techniques from the area of Boolean constraint solving. The primary clasp algorithm relies on conflict-
driven nogood learning, a technique that proved very successful for satisfiability checking (SAT). Unlike other learning ASP solvers, clasp
does not rely on legacy software, such as a SAT solver or any other existing ASP solver. Rather, clasp has been genuinely developed for
answer set solving based on conflict-driven nogood learning. clasp can be applied as an ASP solver (on LPARSE output format), as a SAT
solver (on simplified DIMACS/CNF format), or as a PB solver (on OPB format).
OPTIONS
These programs follow the usual GNU command line syntax, with long options starting with two dashes (`-'). A summary of options is
included below. For a complete description, see <http://www.cs.uni-potsdam.de/clasp/>.
-h, --help
Show summary of options.
-v, --version
Show version of program.
SEE ALSO
gringo(1).
AUTHOR
clasp was written by Benjamin Kaufmann <kaufmann@cs.uni-potsdam.de>.
This manual page was written by Thomas Krennwallner <tkren@kr.tuwien.ac.at>, for the Debian project (and may be used by others).
March 4, 2010 CLASP(1)